Base | Representation |
---|---|
bin | 100100000100000… |
… | …1101010000100101 |
3 | 10010100001000020102 |
4 | 1020020031100211 |
5 | 4434242023023 |
6 | 320024513445 |
7 | 41662526306 |
oct | 11010152045 |
9 | 3110030212 |
10 | 1210111013 |
11 | 571092351 |
12 | 29931b885 |
13 | 163924727 |
14 | b6a027ad |
15 | 71386628 |
hex | 4820d425 |
1210111013 has 2 divisors, whose sum is σ = 1210111014. Its totient is φ = 1210111012.
The previous prime is 1210110973. The next prime is 1210111027. The reversal of 1210111013 is 3101110121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 836771329 + 373339684 = 28927^2 + 19322^2 .
It is an emirp because it is prime and its reverse (3101110121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210111013 - 216 = 1210045477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210110985 and 1210111003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210111073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605055506 + 605055507.
It is an arithmetic number, because the mean of its divisors is an integer number (605055507).
Almost surely, 21210111013 is an apocalyptic number.
It is an amenable number.
1210111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210111013 is an equidigital number, since it uses as much as digits as its factorization.
1210111013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1210111013 is about 34786.6499249353. The cubic root of 1210111013 is about 1065.6348241175.
Adding to 1210111013 its reverse (3101110121), we get a palindrome (4311221134).
The spelling of 1210111013 in words is "one billion, two hundred ten million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •