Base | Representation |
---|---|
bin | 10010101110001100… |
… | …010001001101110101 |
3 | 1220212222001201021220 |
4 | 102232030101031311 |
5 | 312132143233023 |
6 | 13122422300553 |
7 | 1311103623615 |
oct | 225614211565 |
9 | 56788051256 |
10 | 20102321013 |
11 | 8586266345 |
12 | 3a90287759 |
13 | 1b84951a08 |
14 | d89b1ca45 |
15 | 7c9c2d3e3 |
hex | 4ae311375 |
20102321013 has 16 divisors (see below), whose sum is σ = 27060604416. Its totient is φ = 13272857840.
The previous prime is 20102321009. The next prime is 20102321017. The reversal of 20102321013 is 31012320102.
It is an interprime number because it is at equal distance from previous prime (20102321009) and next prime (20102321017).
It is a cyclic number.
It is not a de Polignac number, because 20102321013 - 22 = 20102321009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20102320983 and 20102321001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102321017) 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 15 ways as a sum of consecutive naturals, for example, 2020870 + ... + 2030792.
It is an arithmetic number, because the mean of its divisors is an integer number (1691287776).
Almost surely, 220102321013 is an apocalyptic number.
It is an amenable number.
20102321013 is a deficient number, since it is larger than the sum of its proper divisors (6958283403).
20102321013 is a wasteful number, since it uses less digits than its factorization.
20102321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16344.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20102321013 its reverse (31012320102), we get a palindrome (51114641115).
The spelling of 20102321013 in words is "twenty billion, one hundred two million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •