Base | Representation |
---|---|
bin | 1111100000100… |
… | …11001011111101 |
3 | 100001210212102002 |
4 | 13300103023331 |
5 | 231301231023 |
6 | 20524312045 |
7 | 3136564106 |
oct | 760231375 |
9 | 301725362 |
10 | 130102013 |
11 | 67491628 |
12 | 376a2625 |
13 | 20c53052 |
14 | 133c93ad |
15 | b64db28 |
hex | 7c132fd |
130102013 has 2 divisors, whose sum is σ = 130102014. Its totient is φ = 130102012.
The previous prime is 130102001. The next prime is 130102031. The reversal of 130102013 is 310201031.
Together with next prime (130102031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129663769 + 438244 = 11387^2 + 662^2 .
It is a cyclic number.
It is not a de Polignac number, because 130102013 - 216 = 130036477 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130101985 and 130102003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130102913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65051006 + 65051007.
It is an arithmetic number, because the mean of its divisors is an integer number (65051007).
Almost surely, 2130102013 is an apocalyptic number.
It is an amenable number.
130102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
130102013 is an equidigital number, since it uses as much as digits as its factorization.
130102013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 130102013 is about 11406.2269397027. The cubic root of 130102013 is about 506.7121742270.
Adding to 130102013 its reverse (310201031), we get a palindrome (440303044).
The spelling of 130102013 in words is "one hundred thirty million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •