Base | Representation |
---|---|
bin | 10111001111011001011110… |
… | …010100000000011001110111 |
3 | 111101220111011121221110220211 |
4 | 113033121132110000121313 |
5 | 101344130130241404142 |
6 | 1001220034032010251 |
7 | 30346442504641564 |
oct | 2717313624003167 |
9 | 441814147843824 |
10 | 102213214013047 |
11 | 2a6284206877a5 |
12 | b569732690987 |
13 | 45058845207c7 |
14 | 1b352086db86b |
15 | bc3c00d49917 |
hex | 5cf65e500677 |
102213214013047 has 2 divisors, whose sum is σ = 102213214013048. Its totient is φ = 102213214013046.
The previous prime is 102213214013003. The next prime is 102213214013081. The reversal of 102213214013047 is 740310412312201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102213214013047 - 239 = 101663458199159 is a prime.
It is a super-2 number, since 2×1022132140130472 (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 (102213214043047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106607006523 + 51106607006524.
It is an arithmetic number, because the mean of its divisors is an integer number (51106607006524).
Almost surely, 2102213214013047 is an apocalyptic number.
102213214013047 is a deficient number, since it is larger than the sum of its proper divisors (1).
102213214013047 is an equidigital number, since it uses as much as digits as its factorization.
102213214013047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 102213214013047 its reverse (740310412312201), we get a palindrome (842523626325248).
The spelling of 102213214013047 in words is "one hundred two trillion, two hundred thirteen billion, two hundred fourteen million, thirteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •