Base | Representation |
---|---|
bin | 111110100101101… |
… | …0101010110000101 |
3 | 12102100202022011211 |
4 | 1331023111112011 |
5 | 13300112414023 |
6 | 544220531421 |
7 | 103020515422 |
oct | 17513252605 |
9 | 5370668154 |
10 | 2100123013 |
11 | 98851255a |
12 | 4a73b0b71 |
13 | 276131b51 |
14 | 15ccbcd49 |
15 | c458da0d |
hex | 7d2d5585 |
2100123013 has 2 divisors, whose sum is σ = 2100123014. Its totient is φ = 2100123012.
The previous prime is 2100123007. The next prime is 2100123017. The reversal of 2100123013 is 3103210012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1666109124 + 434013889 = 40818^2 + 20833^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100123013 - 217 = 2099991941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2100122984 and 2100123002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100123017) 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 as a sum of consecutive naturals, namely, 1050061506 + 1050061507.
It is an arithmetic number, because the mean of its divisors is an integer number (1050061507).
Almost surely, 22100123013 is an apocalyptic number.
It is an amenable number.
2100123013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100123013 is an equidigital number, since it uses as much as digits as its factorization.
2100123013 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 13.
The square root of 2100123013 is about 45827.0991117701. The cubic root of 2100123013 is about 1280.6041689254.
Adding to 2100123013 its reverse (3103210012), we get a palindrome (5203333025).
The spelling of 2100123013 in words is "two billion, one hundred million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •