Base | Representation |
---|---|
bin | 1001001100000001101111… |
… | …0100101111000010001001 |
3 | 1022202202121202210200221112 |
4 | 2103000123310233002021 |
5 | 2311003331322423121 |
6 | 33252522250220105 |
7 | 2061601450146344 |
oct | 223003364570211 |
9 | 38682552720845 |
10 | 10102229889161 |
11 | 3245371453923 |
12 | 1171a68424635 |
13 | 583836932cb7 |
14 | 26cd443ab45b |
15 | 127baed0075b |
hex | 9301bd2f089 |
10102229889161 has 2 divisors, whose sum is σ = 10102229889162. Its totient is φ = 10102229889160.
The previous prime is 10102229889127. The next prime is 10102229889163. The reversal of 10102229889161 is 16198892220101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5741103523600 + 4361126365561 = 2396060^2 + 2088331^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102229889161 - 230 = 10101156147337 is a prime.
Together with 10102229889163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10102229889163) 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, 5051114944580 + 5051114944581.
It is an arithmetic number, because the mean of its divisors is an integer number (5051114944581).
Almost surely, 210102229889161 is an apocalyptic number.
It is an amenable number.
10102229889161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102229889161 is an equidigital number, since it uses as much as digits as its factorization.
10102229889161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 50.
The spelling of 10102229889161 in words is "ten trillion, one hundred two billion, two hundred twenty-nine million, eight hundred eighty-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •