Base | Representation |
---|---|
bin | 111110100101101… |
… | …1001101111010101 |
3 | 12102100210012212111 |
4 | 1331023121233111 |
5 | 13300114003023 |
6 | 544221151021 |
7 | 103020622045 |
oct | 17513315725 |
9 | 5370705774 |
10 | 2100141013 |
11 | 988525033 |
12 | 4a73bb471 |
13 | 27613a0b9 |
14 | 15ccc5725 |
15 | c459400d |
hex | 7d2d9bd5 |
2100141013 has 2 divisors, whose sum is σ = 2100141014. Its totient is φ = 2100141012.
The previous prime is 2100140983. The next prime is 2100141031. The reversal of 2100141013 is 3101410012.
Together with next prime (2100141031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1139265009 + 960876004 = 33753^2 + 30998^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100141013 - 25 = 2100140981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2100140984 and 2100141002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100141313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050070506 + 1050070507.
It is an arithmetic number, because the mean of its divisors is an integer number (1050070507).
Almost surely, 22100141013 is an apocalyptic number.
It is an amenable number.
2100141013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100141013 is an equidigital number, since it uses as much as digits as its factorization.
2100141013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 2100141013 is about 45827.2955016985. The cubic root of 2100141013 is about 1280.6078275697.
Adding to 2100141013 its reverse (3101410012), we get a palindrome (5201551025).
The spelling of 2100141013 in words is "two billion, one hundred million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •