Base | Representation |
---|---|
bin | 10010111010101100… |
… | …101000011010001101 |
3 | 1221102120212011210001 |
4 | 102322230220122031 |
5 | 313044401144323 |
6 | 13155315244301 |
7 | 1316232160303 |
oct | 227254503215 |
9 | 57376764701 |
10 | 20312131213 |
11 | 8683739900 |
12 | 3b2a5a9691 |
13 | 1bb926236a |
14 | da9936273 |
15 | 7dd3743ad |
hex | 4bab2868d |
20312131213 has 6 divisors (see below), whose sum is σ = 22326557582. Its totient is φ = 18465573720.
The previous prime is 20312131187. The next prime is 20312131219. The reversal of 20312131213 is 31213121302.
It can be written as a sum of positive squares in only one way, i.e., 20001596329 + 310534884 = 141427^2 + 17622^2 .
It is not a de Polignac number, because 20312131213 - 25 = 20312131181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20312131219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 83934306 + ... + 83934547.
Almost surely, 220312131213 is an apocalyptic number.
It is an amenable number.
20312131213 is a deficient number, since it is larger than the sum of its proper divisors (2014426369).
20312131213 is a wasteful number, since it uses less digits than its factorization.
20312131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167868875 (or 167868864 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20312131213 its reverse (31213121302), we get a palindrome (51525252515).
It can be divided in two parts, 20312 and 131213, that added together give a triangular number (151525 = T550).
The spelling of 20312131213 in words is "twenty billion, three hundred twelve million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •