Base | Representation |
---|---|
bin | 10000001011110110001… |
… | …000111100011010101001 |
3 | 10221022212022001010121000 |
4 | 100023312020330122221 |
5 | 121210322130231441 |
6 | 2210541340305213 |
7 | 143233060244256 |
oct | 20136610743251 |
9 | 3838768033530 |
10 | 1112231102121 |
11 | 399770509057 |
12 | 15b683b42209 |
13 | 80b62a968c9 |
14 | 3bb91a8242d |
15 | 1dde96712b6 |
hex | 102f623c6a9 |
1112231102121 has 32 divisors (see below), whose sum is σ = 1734594048000. Its totient is φ = 702412908624.
The previous prime is 1112231102107. The next prime is 1112231102123. The reversal of 1112231102121 is 1212011322111.
It is a happy number.
It is not a de Polignac number, because 1112231102121 - 25 = 1112231102089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112231102094 and 1112231102103.
It is not an unprimeable number, because it can be changed into a prime (1112231102123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8193520 + ... + 8328158.
It is an arithmetic number, because the mean of its divisors is an integer number (54206064000).
Almost surely, 21112231102121 is an apocalyptic number.
It is an amenable number.
1112231102121 is a deficient number, since it is larger than the sum of its proper divisors (622362945879).
1112231102121 is a wasteful number, since it uses less digits than its factorization.
1112231102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150770 (or 150764 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1112231102121 its reverse (1212011322111), we get a palindrome (2324242424232).
The spelling of 1112231102121 in words is "one trillion, one hundred twelve billion, two hundred thirty-one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •