Marco Ripà is a member of GIGA Society.

Mr. Ripà was born in 1984 in Rome and still resides there.

Mr. Ripà initially studied physics, but he went on to earn a first-class degree in economics. He speaks Italian, English, French, a little Spanish, and is also able to understand some Portuguese. Mr. Ripà excels in mathematics, and he enjoys science very much, too.

Marco Ripà’s interests and hobbies include philosophy, Italian poetry (especially Dante Alighieri’s verses), literature, chess, powerlifting, fishing, and martial arts. He often relaxes by listening to classical compositions, but he prefers rock music and melodic songs. Mr. Ripà has a younger sister and some very good friends. He is an author of papers on number theory and is the father of 90+ integer sequences listed in OEIS (see

In 2014, the members of the World Genius Directory awarded Marco Ripà with the Genius of the Year (GOTY) Award for Europe.

In November 2014, Mr. Ripà released his masterpiece book, 1729: il numero di Mr. 17-29.

In 2020, Marco Ripà solved the infamous “Nine Dots Problem” generalized to k-dimensions (see Journal of Fundamental Mathematics and Applications, Vol. 3, no. 2, pp. 84-97); and in 2021, he released the congruence speed formula for the integer tetration (hyper-4) (published in Notes on Number Theory and Discrete Mathematics, Vol. 27, no. 4, pp. 43-61).

Mr. Ripà is a member of more than thirty high-IQ societies.

His personal YouTube channel, which is focused on mathematics, logic, and philosophy, has over 160K subscribers.

The average score Marco Ripà achieved on the first submissions of high-range IQ tests (the mean of all the spatial and numerical tests he has taken) is close to 200 on the Cattell Scale (SD 24), while his best performance reaches 211 on the same scale.

Mr. Ripà is the creator of the ENNDT/ENSDT and also the X-Test, a spoiled, difficult, logical/numerical test which requires some divergent thinking (see

Marco Ripà is an independent researcher (ORCiD ID: 0000-0002-6036-5541) currently focused on developing the formula for the number of stable digits of any integer tetration. He is also writing original research papers about optimal polygonal chains covering many given k-dimensional grids of the form G(n_1, n_2, …, n_k): = {1, 2, …, n_1 – 1} x {1, 2, …, n_2 – 1} x … x {1, 2, …, n_k – 1}.

49/56 on Sigma Test by Hindemburg Melão Jr.