Base | Representation |
---|---|
bin | 10000010100001101010… |
… | …100101110001010000001 |
3 | 10222012001001102101221100 |
4 | 100110031110232022001 |
5 | 121332214230000001 |
6 | 2215024325245013 |
7 | 144001425516150 |
oct | 20241524561201 |
9 | 3865031371840 |
10 | 1121210000001 |
11 | 3a25588a6a13 |
12 | 16136ab63769 |
13 | 81964068c30 |
14 | 3c3a4363597 |
15 | 1e272a80586 |
hex | 1050d52e281 |
1121210000001 has 96 divisors (see below), whose sum is σ = 2049283611648. Its totient is φ = 574819338240.
The previous prime is 1121209999981. The next prime is 1121210000003. The reversal of 1121210000001 is 1000000121211.
It is a happy number.
It is not a de Polignac number, because 1121210000001 - 27 = 1121209999873 is a prime.
It is a super-2 number, since 2×11212100000012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1121210000003) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 29587096 + ... + 29624966.
It is an arithmetic number, because the mean of its divisors is an integer number (21346704288).
Almost surely, 21121210000001 is an apocalyptic number.
It is an amenable number.
1121210000001 is a deficient number, since it is larger than the sum of its proper divisors (928073611647).
1121210000001 is a wasteful number, since it uses less digits than its factorization.
1121210000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38911 (or 38908 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1121210000001 its reverse (1000000121211), we get a palindrome (2121210121212).
The spelling of 1121210000001 in words is "one trillion, one hundred twenty-one billion, two hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •