Base | Representation |
---|---|
bin | 10010111010100101… |
… | …000011101111101111 |
3 | 1221102110010022121210 |
4 | 102322211003233233 |
5 | 313043344133111 |
6 | 13155204525503 |
7 | 1316206251510 |
oct | 227245035757 |
9 | 57373108553 |
10 | 20310146031 |
11 | 868260335a |
12 | 3b299b0893 |
13 | 1bb8a188b6 |
14 | da957aa07 |
15 | 7dd0d10a6 |
hex | 4ba943bef |
20310146031 has 32 divisors (see below), whose sum is σ = 31996735488. Its totient is φ = 11213982720.
The previous prime is 20310146029. The next prime is 20310146039. The reversal of 20310146031 is 13064101302.
It is not a de Polignac number, because 20310146031 - 21 = 20310146029 is a prime.
It is a super-2 number, since 2×203101460312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 20310145989 and 20310146007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20310146039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 401215 + ... + 448991.
It is an arithmetic number, because the mean of its divisors is an integer number (999897984).
Almost surely, 220310146031 is an apocalyptic number.
20310146031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20310146031 is a deficient number, since it is larger than the sum of its proper divisors (11686589457).
20310146031 is a wasteful number, since it uses less digits than its factorization.
20310146031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48471.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20310146031 its reverse (13064101302), we get a palindrome (33374247333).
The spelling of 20310146031 in words is "twenty billion, three hundred ten million, one hundred forty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •