Base | Representation |
---|---|
bin | 1001010001101111111000… |
… | …11001110110000001101111 |
3 | 2200020022122011021212201221 |
4 | 10220313330121312001233 |
5 | 10133222304241301111 |
6 | 111220034503244211 |
7 | 4203632435353006 |
oct | 450677431660157 |
9 | 80208564255657 |
10 | 20401034322031 |
11 | 6556037025930 |
12 | 2355a35149667 |
13 | b4ca69cb853c |
14 | 5075b5943c3d |
15 | 255a27490371 |
hex | 128dfc67606f |
20401034322031 has 16 divisors (see below), whose sum is σ = 23033765527200. Its totient is φ = 17898576998400.
The previous prime is 20401034322017. The next prime is 20401034322059. The reversal of 20401034322031 is 13022343010402.
It is a cyclic number.
It is not a de Polignac number, because 20401034322031 - 27 = 20401034321903 is a prime.
It is a super-2 number, since 2×204010343220312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20401034321987 and 20401034322005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20401034322001) 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, 14107746 + ... + 15486463.
It is an arithmetic number, because the mean of its divisors is an integer number (1439610345450).
Almost surely, 220401034322031 is an apocalyptic number.
20401034322031 is a deficient number, since it is larger than the sum of its proper divisors (2632731205169).
20401034322031 is a wasteful number, since it uses less digits than its factorization.
20401034322031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29596410.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 20401034322031 its reverse (13022343010402), we get a palindrome (33423377332433).
The spelling of 20401034322031 in words is "twenty trillion, four hundred one billion, thirty-four million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •