Base | Representation |
---|---|
bin | 11011101111011110110000… |
… | …110011001111101100010111 |
3 | 121000000001101210200212121020 |
4 | 123233132300303033230113 |
5 | 111443003142130413421 |
6 | 1111254400035052223 |
7 | 34461640034034465 |
oct | 3357366063175427 |
9 | 530001353625536 |
10 | 122010102201111 |
11 | 35970214994233 |
12 | 11826460441073 |
13 | 53106708b2b27 |
14 | 221b46b487835 |
15 | e18b6947cdc6 |
hex | 6ef7b0ccfb17 |
122010102201111 has 8 divisors (see below), whose sum is σ = 162680196436464. Its totient is φ = 81340038049920.
The previous prime is 122010102201047. The next prime is 122010102201121. The reversal of 122010102201111 is 111102201010221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122010102201111 - 26 = 122010102201047 is a prime.
It is a super-4 number, since 4×1220101022011114 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122010102201121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4848175 + ... + 16356191.
It is an arithmetic number, because the mean of its divisors is an integer number (20335024554558).
Almost surely, 2122010102201111 is an apocalyptic number.
122010102201111 is a deficient number, since it is larger than the sum of its proper divisors (40670094235353).
122010102201111 is a wasteful number, since it uses less digits than its factorization.
122010102201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15042081.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122010102201111 its reverse (111102201010221), we get a palindrome (233112303211332).
The spelling of 122010102201111 in words is "one hundred twenty-two trillion, ten billion, one hundred two million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •