Base | Representation |
---|---|
bin | 10001101000000011000… |
… | …011110111010010010000 |
3 | 11021210101211221000201222 |
4 | 101220003003313102100 |
5 | 124321100410401000 |
6 | 2324233215544212 |
7 | 153336314110265 |
oct | 21500303672220 |
9 | 4253354830658 |
10 | 1211232122000 |
11 | 427753a5764a |
12 | 1768b322b068 |
13 | 8a2ac635444 |
14 | 428a417d26c |
15 | 21790d2ba85 |
hex | 11a030f7490 |
1211232122000 has 80 divisors (see below), whose sum is σ = 2978399548800. Its totient is φ = 476281059200.
The previous prime is 1211232121993. The next prime is 1211232122029. The reversal of 1211232122000 is 2212321121.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 1211232122000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5014340 + ... + 5250339.
It is an arithmetic number, because the mean of its divisors is an integer number (37229994360).
Almost surely, 21211232122000 is an apocalyptic number.
1211232122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211232122000 is an abundant number, since it is smaller than the sum of its proper divisors (1767167426800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211232122000 is a wasteful number, since it uses less digits than its factorization.
1211232122000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10264761 (or 10264745 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1211232122000 its reverse (2212321121), we get a palindrome (1213444443121).
The spelling of 1211232122000 in words is "one trillion, two hundred eleven billion, two hundred thirty-two million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •