Base | Representation |
---|---|
bin | 11110100011111110010… |
… | …001101110011100011101 |
3 | 21102210000020211101020011 |
4 | 132203332101232130131 |
5 | 233402212241144442 |
6 | 4244453451123221 |
7 | 304510110205012 |
oct | 36437621563435 |
9 | 7383006741204 |
10 | 2100210099997 |
11 | 73a76a938149 |
12 | 29b050143511 |
13 | 123083756329 |
14 | 739177a1709 |
15 | 399708b9117 |
hex | 1e8fe46e71d |
2100210099997 has 2 divisors, whose sum is σ = 2100210099998. Its totient is φ = 2100210099996.
The previous prime is 2100210099991. The next prime is 2100210100003. The reversal of 2100210099997 is 7999900120012.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (2100210099991) and next prime (2100210100003).
It can be written as a sum of positive squares in only one way, i.e., 1619699110276 + 480510989721 = 1272674^2 + 693189^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100210099997 - 23 = 2100210099989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2100210099997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100210099991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050105049998 + 1050105049999.
It is an arithmetic number, because the mean of its divisors is an integer number (1050105049999).
Almost surely, 22100210099997 is an apocalyptic number.
It is an amenable number.
2100210099997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100210099997 is an equidigital number, since it uses as much as digits as its factorization.
2100210099997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 49.
The spelling of 2100210099997 in words is "two trillion, one hundred billion, two hundred ten million, ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •