Base | Representation |
---|---|
bin | 10010101111110110… |
… | …010110100011001001 |
3 | 1220221220101120012212 |
4 | 102233312112203021 |
5 | 312211303130441 |
6 | 13125254314505 |
7 | 1311562166003 |
oct | 225766264311 |
9 | 56856346185 |
10 | 20130130121 |
11 | 859aa2a782 |
12 | 3a99658a35 |
13 | 1b8a63a6ca |
14 | d8d6bb373 |
15 | 7cc3c2eeb |
hex | 4afd968c9 |
20130130121 has 2 divisors, whose sum is σ = 20130130122. Its totient is φ = 20130130120.
The previous prime is 20130130091. The next prime is 20130130129. The reversal of 20130130121 is 12103103102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11164880896 + 8965249225 = 105664^2 + 94685^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20130130121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20130130096 and 20130130105.
It is not a weakly prime, because it can be changed into another prime (20130130129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065065060 + 10065065061.
It is an arithmetic number, because the mean of its divisors is an integer number (10065065061).
Almost surely, 220130130121 is an apocalyptic number.
It is an amenable number.
20130130121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130130121 is an equidigital number, since it uses as much as digits as its factorization.
20130130121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20130130121 its reverse (12103103102), we get a palindrome (32233233223).
The spelling of 20130130121 in words is "twenty billion, one hundred thirty million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •