Base | Representation |
---|---|
bin | 10000010100001101111… |
… | …011101010110101011100 |
3 | 10222012001202122010102220 |
4 | 100110031323222311130 |
5 | 121332224333210022 |
6 | 2215025332145340 |
7 | 144001611352020 |
oct | 20241573526534 |
9 | 3865052563386 |
10 | 1121220210012 |
11 | 3a256363a941 |
12 | 161372468250 |
13 | 81966202266 |
14 | 3c3a5860380 |
15 | 1e2738ea85c |
hex | 1050deead5c |
1121220210012 has 48 divisors (see below), whose sum is σ = 2990104320000. Its totient is φ = 320328942912.
The previous prime is 1121220209987. The next prime is 1121220210013. The reversal of 1121220210012 is 2100120221211.
It is a junction number, because it is equal to n+sod(n) for n = 1121220209973 and 1121220210000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121220210013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 993114 + ... + 1796862.
It is an arithmetic number, because the mean of its divisors is an integer number (62293840000).
Almost surely, 21121220210012 is an apocalyptic number.
1121220210012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121220210012 is an abundant number, since it is smaller than the sum of its proper divisors (1868884109988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121220210012 is a wasteful number, since it uses less digits than its factorization.
1121220210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820370 (or 820368 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1121220210012 its reverse (2100120221211), we get a palindrome (3221340431223).
The spelling of 1121220210012 in words is "one trillion, one hundred twenty-one billion, two hundred twenty million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •