Base | Representation |
---|---|
bin | 1001001001111001010011… |
… | …10000001011001100111000 |
3 | 2122021112011210101110011021 |
4 | 10210330221300023030320 |
5 | 10114312210311223000 |
6 | 110452052355112224 |
7 | 4145301130303042 |
oct | 444745160131470 |
9 | 78245153343137 |
10 | 20131212211000 |
11 | 6461665523240 |
12 | 23116922a2674 |
13 | b30499366a87 |
14 | 4d84da714a92 |
15 | 24d9d434811a |
hex | 124f29c0b338 |
20131212211000 has 64 divisors (see below), whose sum is σ = 51389494472160. Its totient is φ = 7320440800000.
The previous prime is 20131212210997. The next prime is 20131212211003. The reversal of 20131212211000 is 11221213102.
It is an interprime number because it is at equal distance from previous prime (20131212210997) and next prime (20131212211003).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131212211003) 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, 915044101 + ... + 915066100.
Almost surely, 220131212211000 is an apocalyptic number.
20131212211000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20131212211000 is an abundant number, since it is smaller than the sum of its proper divisors (31258282261160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20131212211000 is a wasteful number, since it uses less digits than its factorization.
20131212211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1830110233 (or 1830110219 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20131212211000 its reverse (11221213102), we get a palindrome (20142433424102).
The spelling of 20131212211000 in words is "twenty trillion, one hundred thirty-one billion, two hundred twelve million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •