Base | Representation |
---|---|
bin | 1001001100000001101011… |
… | …0000111000011100110101 |
3 | 1022202202120112100000110121 |
4 | 2103000122300320130311 |
5 | 2311003312244230231 |
6 | 33252520413051541 |
7 | 2061601143024511 |
oct | 223003260703465 |
9 | 38682515300417 |
10 | 10102212101941 |
11 | 3245362405043 |
12 | 1171a62486bb1 |
13 | 583833045b0b |
14 | 26cd41c9b141 |
15 | 127bad48a311 |
hex | 9301ac38735 |
10102212101941 has 2 divisors, whose sum is σ = 10102212101942. Its totient is φ = 10102212101940.
The previous prime is 10102212101897. The next prime is 10102212102071. The reversal of 10102212101941 is 14910121220101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7001601770916 + 3100610331025 = 2646054^2 + 1760855^2 .
It is an emirp because it is prime and its reverse (14910121220101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10102212101941 - 211 = 10102212099893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10102212101741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051106050970 + 5051106050971.
It is an arithmetic number, because the mean of its divisors is an integer number (5051106050971).
Almost surely, 210102212101941 is an apocalyptic number.
It is an amenable number.
10102212101941 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102212101941 is an equidigital number, since it uses as much as digits as its factorization.
10102212101941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 10102212101941 in words is "ten trillion, one hundred two billion, two hundred twelve million, one hundred one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •