Base | Representation |
---|---|
bin | 10111001111011001011101… |
… | …100011001111100101010111 |
3 | 111101220111010201220001002211 |
4 | 113033121131203033211113 |
5 | 101344130114003331132 |
6 | 1001220032454014251 |
7 | 30346442261201656 |
oct | 2717313543174527 |
9 | 441814121801084 |
10 | 102213201230167 |
11 | 2a628414446835 |
12 | b56972a347387 |
13 | 4505881996381 |
14 | 1b35206b3119d |
15 | bc3beeb72147 |
hex | 5cf65d8cf957 |
102213201230167 has 2 divisors, whose sum is σ = 102213201230168. Its totient is φ = 102213201230166.
The previous prime is 102213201230149. The next prime is 102213201230291. The reversal of 102213201230167 is 761032102312201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102213201230167 - 239 = 101663445416279 is a prime.
It is a super-2 number, since 2×1022132012301672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102213208230167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106600615083 + 51106600615084.
It is an arithmetic number, because the mean of its divisors is an integer number (51106600615084).
Almost surely, 2102213201230167 is an apocalyptic number.
102213201230167 is a deficient number, since it is larger than the sum of its proper divisors (1).
102213201230167 is an equidigital number, since it uses as much as digits as its factorization.
102213201230167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
Adding to 102213201230167 its reverse (761032102312201), we get a palindrome (863245303542368).
The spelling of 102213201230167 in words is "one hundred two trillion, two hundred thirteen billion, two hundred one million, two hundred thirty thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •