Base | Representation |
---|---|
bin | 1001001111001100001000… |
… | …10111111010101100100111 |
3 | 2122220220201100020210220120 |
4 | 10213212010113322230213 |
5 | 10130302233012030111 |
6 | 111111415152133023 |
7 | 4164401036242314 |
oct | 447460427725447 |
9 | 78826640223816 |
10 | 20313121205031 |
11 | 65218233a3936 |
12 | 234099b237173 |
13 | b44699640895 |
14 | 503235c79d0b |
15 | 2535ce439406 |
hex | 1279845fab27 |
20313121205031 has 32 divisors (see below), whose sum is σ = 27387609532416. Its totient is φ = 13390713600000.
The previous prime is 20313121205029. The next prime is 20313121205077. The reversal of 20313121205031 is 13050212131302.
It is a happy number.
It is not a de Polignac number, because 20313121205031 - 21 = 20313121205029 is a prime.
It is a super-2 number, since 2×203131212050312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20313121204992 and 20313121205010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20313121203031) 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, 866921886 + ... + 866945316.
It is an arithmetic number, because the mean of its divisors is an integer number (855862797888).
Almost surely, 220313121205031 is an apocalyptic number.
20313121205031 is a deficient number, since it is larger than the sum of its proper divisors (7074488327385).
20313121205031 is a wasteful number, since it uses less digits than its factorization.
20313121205031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27103.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 20313121205031 its reverse (13050212131302), we get a palindrome (33363333336333).
The spelling of 20313121205031 in words is "twenty trillion, three hundred thirteen billion, one hundred twenty-one million, two hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •