Base | Representation |
---|---|
bin | 1001010010010011010000… |
… | …0101110111110001100101 |
3 | 1100011001211020101110021111 |
4 | 2110210310011313301211 |
5 | 2314240100332420442 |
6 | 33414225302145021 |
7 | 2102435411262004 |
oct | 224446405676145 |
9 | 40131736343244 |
10 | 10210011216997 |
11 | 3287050180779 |
12 | 118a928122171 |
13 | 590a52591627 |
14 | 27424aa52c3b |
15 | 12a8bc23db17 |
hex | 94934177c65 |
10210011216997 has 2 divisors, whose sum is σ = 10210011216998. Its totient is φ = 10210011216996.
The previous prime is 10210011216991. The next prime is 10210011217027. The reversal of 10210011216997 is 79961211001201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5546618475876 + 4663392741121 = 2355126^2 + 2159489^2 .
It is an emirp because it is prime and its reverse (79961211001201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10210011216997 is a prime.
It is a super-2 number, since 2×102100112169972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210011216991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105005608498 + 5105005608499.
It is an arithmetic number, because the mean of its divisors is an integer number (5105005608499).
Almost surely, 210210011216997 is an apocalyptic number.
It is an amenable number.
10210011216997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210011216997 is an equidigital number, since it uses as much as digits as its factorization.
10210011216997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 40.
The spelling of 10210011216997 in words is "ten trillion, two hundred ten billion, eleven million, two hundred sixteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •