Base | Representation |
---|---|
bin | 1001000110011011011100… |
… | …01111010001111001110000 |
3 | 2121212010201210202110211101 |
4 | 10203031232033101321300 |
5 | 10110334241121200222 |
6 | 110321233252454144 |
7 | 4133553355315354 |
oct | 443155617217160 |
9 | 77763653673741 |
10 | 20012102131312 |
11 | 64160a2a36455 |
12 | 22b259061a354 |
13 | b22196657195 |
14 | 4d283b663464 |
15 | 24a86257c927 |
hex | 12336e3d1e70 |
20012102131312 has 20 divisors (see below), whose sum is σ = 39675155971000. Its totient is φ = 9773352203328.
The previous prime is 20012102131309. The next prime is 20012102131319. The reversal of 20012102131312 is 21313120121002.
It is a self number, because there is not a number n which added to its sum of digits gives 20012102131312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012102131319) by changing a digit.
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, 14543678187 + ... + 14543679562.
It is an arithmetic number, because the mean of its divisors is an integer number (1983757798550).
Almost surely, 220012102131312 is an apocalyptic number.
It is an amenable number.
20012102131312 is a deficient number, since it is larger than the sum of its proper divisors (19663053839688).
20012102131312 is a wasteful number, since it uses less digits than its factorization.
20012102131312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29087357800 (or 29087357794 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 20012102131312 its reverse (21313120121002), we get a palindrome (41325222252314).
The spelling of 20012102131312 in words is "twenty trillion, twelve billion, one hundred two million, one hundred thirty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •