Base | Representation |
---|---|
bin | 1001000110000101011111… |
… | …00000101011110110101101 |
3 | 2121211000022011010120002201 |
4 | 10203002233200223312231 |
5 | 10110141114422424323 |
6 | 110312003332021501 |
7 | 4132655245435123 |
oct | 443025740536655 |
9 | 77730264116081 |
10 | 20000312311213 |
11 | 64110a2990083 |
12 | 22b0240161891 |
13 | b21037c02380 |
14 | 4d203d917913 |
15 | 24a3c24c78ad |
hex | 1230af82bdad |
20000312311213 has 8 divisors (see below), whose sum is σ = 21551126918048. Its totient is φ = 18451258996464.
The previous prime is 20000312311207. The next prime is 20000312311237. The reversal of 20000312311213 is 31211321300002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20000312311213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000312311253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 440299431 + ... + 440344852.
It is an arithmetic number, because the mean of its divisors is an integer number (2693890864756).
Almost surely, 220000312311213 is an apocalyptic number.
It is an amenable number.
20000312311213 is a deficient number, since it is larger than the sum of its proper divisors (1550814606835).
20000312311213 is a wasteful number, since it uses less digits than its factorization.
20000312311213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880646043.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20000312311213 its reverse (31211321300002), we get a palindrome (51211633611215).
The spelling of 20000312311213 in words is "twenty trillion, three hundred twelve million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •