Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …1000111000100110000000 |
3 | 1022211120101101212120111001 |
4 | 2103102001320320212000 |
5 | 2311311024230401422 |
6 | 33305325044301344 |
7 | 2063140561400611 |
oct | 223220170704600 |
9 | 38746341776431 |
10 | 10121122122112 |
11 | 3252386643091 |
12 | 117565b3a1854 |
13 | 58555796a871 |
14 | 26dc174d1c08 |
15 | 12841869e227 |
hex | 93481e38980 |
10121122122112 has 16 divisors (see below), whose sum is σ = 20163172977900. Its totient is φ = 5060561060992.
The previous prime is 10121122122071. The next prime is 10121122122193. The reversal of 10121122122112 is 21122122112101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (16).
It is a super-2 number, since 2×101211221221122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10121122122112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 39535633162 + ... + 39535633417.
Almost surely, 210121122122112 is an apocalyptic number.
It is an amenable number.
10121122122112 is a deficient number, since it is larger than the sum of its proper divisors (10042050855788).
10121122122112 is an frugal number, since it uses more digits than its factorization.
10121122122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79071266593 (or 79071266581 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 10121122122112 its reverse (21122122112101), we get a palindrome (31243244234213).
It can be divided in two parts, 101 and 21122122112, that multiplied together give a palindrome (2133334333312).
The spelling of 10121122122112 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •