Base | Representation |
---|---|
bin | 1001001111000110100100… |
… | …00110001000111100000011 |
3 | 2122220121222220011000210102 |
4 | 10213203102012020330003 |
5 | 10130230121312402243 |
6 | 111110202304353015 |
7 | 4164233650153055 |
oct | 447432206107403 |
9 | 78817886130712 |
10 | 20310130200323 |
11 | 6520529017817 |
12 | 23402a561576b |
13 | b44310a88802 |
14 | 5030309358d5 |
15 | 2534a6a709b8 |
hex | 1278d2188f03 |
20310130200323 has 32 divisors (see below), whose sum is σ = 21217746161664. Its totient is φ = 19419166800000.
The previous prime is 20310130200319. The next prime is 20310130200331. The reversal of 20310130200323 is 32300203101302.
It is a cyclic number.
It is not a de Polignac number, because 20310130200323 - 22 = 20310130200319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20310130200295 and 20310130200304.
It is not an unprimeable number, because it can be changed into a prime (20310130200343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3270022688 + ... + 3270028898.
It is an arithmetic number, because the mean of its divisors is an integer number (663054567552).
Almost surely, 220310130200323 is an apocalyptic number.
20310130200323 is a deficient number, since it is larger than the sum of its proper divisors (907615961341).
20310130200323 is a wasteful number, since it uses less digits than its factorization.
20310130200323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8387.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20310130200323 its reverse (32300203101302), we get a palindrome (52610333301625).
The spelling of 20310130200323 in words is "twenty trillion, three hundred ten billion, one hundred thirty million, two hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •