Base | Representation |
---|---|
bin | 10000001101110010001… |
… | …011101111011011001001 |
3 | 10221112020100000101002002 |
4 | 100031302023233123021 |
5 | 121224102411210441 |
6 | 2211524041520345 |
7 | 143335460335445 |
oct | 20156213573311 |
9 | 3845210011062 |
10 | 1114312210121 |
11 | 39a639213320 |
12 | 15bb64aa30b5 |
13 | 81104c9b766 |
14 | 3bd0c211825 |
15 | 1debc205b9b |
hex | 103722ef6c9 |
1114312210121 has 32 divisors (see below), whose sum is σ = 1282417920000. Its totient is φ = 957578448960.
The previous prime is 1114312210117. The next prime is 1114312210153. The reversal of 1114312210121 is 1210122134111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1114312210121 - 22 = 1114312210117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1114312210093 and 1114312210102.
It is not an unprimeable number, because it can be changed into a prime (1114312210171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 256810970 + ... + 256815308.
It is an arithmetic number, because the mean of its divisors is an integer number (40075560000).
Almost surely, 21114312210121 is an apocalyptic number.
1114312210121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1114312210121 is a deficient number, since it is larger than the sum of its proper divisors (168105709879).
1114312210121 is a wasteful number, since it uses less digits than its factorization.
1114312210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6797.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 1114312210121 its reverse (1210122134111), we get a palindrome (2324434344232).
The spelling of 1114312210121 in words is "one trillion, one hundred fourteen billion, three hundred twelve million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •