Base | Representation |
---|---|
bin | 1001100011001011100101… |
… | …11010010100111110010111 |
3 | 2202100120201201011121100220 |
4 | 10301211302322110332113 |
5 | 10223031021342044111 |
6 | 112355135525405423 |
7 | 4265126101215102 |
oct | 461456272247627 |
9 | 82316651147326 |
10 | 21000023003031 |
11 | 67670725744a6 |
12 | 2431b41269873 |
13 | b943a8274827 |
14 | 528599771739 |
15 | 2663d3642e06 |
hex | 131972e94f97 |
21000023003031 has 8 divisors (see below), whose sum is σ = 28000243646064. Its totient is φ = 13999908847680.
The previous prime is 21000023003023. The next prime is 21000023003111. The reversal of 21000023003031 is 13030032000012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21000023003031 - 23 = 21000023003023 is a prime.
It is a super-2 number, since 2×210000230030312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21000023003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000023002031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26160630 + ... + 26951411.
It is an arithmetic number, because the mean of its divisors is an integer number (3500030455758).
Almost surely, 221000023003031 is an apocalyptic number.
21000023003031 is a deficient number, since it is larger than the sum of its proper divisors (7000220643033).
21000023003031 is a wasteful number, since it uses less digits than its factorization.
21000023003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53243841.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 21000023003031 its reverse (13030032000012), we get a palindrome (34030055003043).
The spelling of 21000023003031 in words is "twenty-one trillion, twenty-three million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •