Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …110110010101001110111111 |
3 | 120220012121122022201110100022 |
4 | 123203333313312111032333 |
5 | 111342041122133210421 |
6 | 1105452100133322355 |
7 | 34350633612550463 |
oct | 3343776766251677 |
9 | 526177568643308 |
10 | 121221020210111 |
11 | 35696600757278 |
12 | 117195424963bb |
13 | 5284129884413 |
14 | 21d11b316c4a3 |
15 | e033849317ab |
hex | 6e3ff7d953bf |
121221020210111 has 48 divisors (see below), whose sum is σ = 133002397301760. Its totient is φ = 110334439111680.
The previous prime is 121221020210099. The next prime is 121221020210113. The reversal of 121221020210111 is 111012020122121.
It is a de Polignac number, because none of the positive numbers 2k-121221020210111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121221020210111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121221020210113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1736133581 + ... + 1736203401.
It is an arithmetic number, because the mean of its divisors is an integer number (2770883277120).
Almost surely, 2121221020210111 is an apocalyptic number.
121221020210111 is a deficient number, since it is larger than the sum of its proper divisors (11781377091649).
121221020210111 is a wasteful number, since it uses less digits than its factorization.
121221020210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70704 (or 70685 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121221020210111 its reverse (111012020122121), we get a palindrome (232233040332232).
The spelling of 121221020210111 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •