Base | Representation |
---|---|
bin | 1001001001111001011110… |
… | …00111011101001011100000 |
3 | 2122021112102001201100220101 |
4 | 10210330233013131023200 |
5 | 10114312401330400112 |
6 | 110452105331552144 |
7 | 4145303302221532 |
oct | 444745707351340 |
9 | 78245361640811 |
10 | 20131302200032 |
11 | 64617012a7341 |
12 | 23116b845b654 |
13 | b304b1bb3a1a |
14 | 4d850865b852 |
15 | 24d9dc1c1757 |
hex | 124f2f1dd2e0 |
20131302200032 has 24 divisors (see below), whose sum is σ = 39633614477856. Its totient is φ = 10065622332672.
The previous prime is 20131302199933. The next prime is 20131302200131. The reversal of 20131302200032 is 23000220313102.
It is an interprime number because it is at equal distance from previous prime (20131302199933) and next prime (20131302200131).
It is a junction number, because it is equal to n+sod(n) for n = 20131302199982 and 20131302200009.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14565268 + ... + 15887404.
It is an arithmetic number, because the mean of its divisors is an integer number (1651400603244).
Almost surely, 220131302200032 is an apocalyptic number.
It is an amenable number.
20131302200032 is a deficient number, since it is larger than the sum of its proper divisors (19502312277824).
20131302200032 is a wasteful number, since it uses less digits than its factorization.
20131302200032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1797970 (or 1797962 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20131302200032 its reverse (23000220313102), we get a palindrome (43131522513134).
The spelling of 20131302200032 in words is "twenty trillion, one hundred thirty-one billion, three hundred two million, two hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •