Base | Representation |
---|---|
bin | 10010101001111101… |
… | …000000001000011101 |
3 | 1220201000020220100011 |
4 | 102221331000020131 |
5 | 312010442210023 |
6 | 13111402203221 |
7 | 1306251322123 |
oct | 225175001035 |
9 | 56630226304 |
10 | 20031210013 |
11 | 854a106621 |
12 | 3a704b3511 |
13 | 1b72cb45b9 |
14 | d804cb913 |
15 | 7c388350d |
hex | 4a9f4021d |
20031210013 has 4 divisors (see below), whose sum is σ = 20031949728. Its totient is φ = 20030470300.
The previous prime is 20031209983. The next prime is 20031210019. The reversal of 20031210013 is 31001213002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20031210013 - 25 = 20031209981 is a prime.
It is a super-2 number, since 2×200312100132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20031209975 and 20031210002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20031210019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 327631 + ... + 383932.
It is an arithmetic number, because the mean of its divisors is an integer number (5007987432).
Almost surely, 220031210013 is an apocalyptic number.
It is an amenable number.
20031210013 is a deficient number, since it is larger than the sum of its proper divisors (739715).
20031210013 is an equidigital number, since it uses as much as digits as its factorization.
20031210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739714.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20031210013 its reverse (31001213002), we get a palindrome (51032423015).
The spelling of 20031210013 in words is "twenty billion, thirty-one million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.019 sec. • engine limits •