Base | Representation |
---|---|
bin | 1001001100011111011011… |
… | …1001001000100101000011 |
3 | 1022210112012020101110100221 |
4 | 2103013312321020211003 |
5 | 2311121142224014341 |
6 | 33300321210123511 |
7 | 2062303120636405 |
oct | 223076671104503 |
9 | 38715166343327 |
10 | 10110200219971 |
11 | 32487914a7385 |
12 | 1173511720597 |
13 | 584506c88887 |
14 | 26d49cb50b75 |
15 | 127ec98d9ed1 |
hex | 931f6e48943 |
10110200219971 has 2 divisors, whose sum is σ = 10110200219972. Its totient is φ = 10110200219970.
The previous prime is 10110200219963. The next prime is 10110200219981. The reversal of 10110200219971 is 17991200201101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10110200219971 - 23 = 10110200219963 is a prime.
It is a super-2 number, since 2×101102002199712 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10110200219981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055100109985 + 5055100109986.
It is an arithmetic number, because the mean of its divisors is an integer number (5055100109986).
Almost surely, 210110200219971 is an apocalyptic number.
10110200219971 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110200219971 is an equidigital number, since it uses as much as digits as its factorization.
10110200219971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 34.
The spelling of 10110200219971 in words is "ten trillion, one hundred ten billion, two hundred million, two hundred nineteen thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •