Base | Representation |
---|---|
bin | 10111001111100001101111… |
… | …111101010111000101011001 |
3 | 111101221100002220111102221221 |
4 | 113033201233331113011121 |
5 | 101344301330100013423 |
6 | 1001224103501332041 |
7 | 30350205634411411 |
oct | 2717415775270531 |
9 | 441840086442857 |
10 | 102222100001113 |
11 | 2a631170587094 |
12 | b56b3b2567021 |
13 | 450666c492601 |
14 | 1b3580c915641 |
15 | bc4071004e5d |
hex | 5cf86ff57159 |
102222100001113 has 2 divisors, whose sum is σ = 102222100001114. Its totient is φ = 102222100001112.
The previous prime is 102222100001083. The next prime is 102222100001207. The reversal of 102222100001113 is 311100001222201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94705362062224 + 7516737938889 = 9731668^2 + 2741667^2 .
It is a cyclic number.
It is not a de Polignac number, because 102222100001113 - 237 = 102084661047641 is a prime.
It is not a weakly prime, because it can be changed into another prime (102222100001713) 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, 51111050000556 + 51111050000557.
It is an arithmetic number, because the mean of its divisors is an integer number (51111050000557).
Almost surely, 2102222100001113 is an apocalyptic number.
It is an amenable number.
102222100001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
102222100001113 is an equidigital number, since it uses as much as digits as its factorization.
102222100001113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102222100001113 its reverse (311100001222201), we get a palindrome (413322101223314).
The spelling of 102222100001113 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •