Base | Representation |
---|---|
bin | 10111001111100001110000… |
… | …100111101111110000001001 |
3 | 111101221100010200101221111201 |
4 | 113033201300213233300021 |
5 | 101344301340421042301 |
6 | 1001224104535424201 |
7 | 30350206131016303 |
oct | 2717416047576011 |
9 | 441840120357451 |
10 | 102222111112201 |
11 | 2a631176886003 |
12 | b56b3b6225061 |
13 | 4506671882b12 |
14 | 1b358101a8973 |
15 | bc4071e9c201 |
hex | 5cf8709efc09 |
102222111112201 has 16 divisors (see below), whose sum is σ = 104671500913728. Its totient is φ = 99804730060800.
The previous prime is 102222111112189. The next prime is 102222111112207. The reversal of 102222111112201 is 102211111222201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102222111112201 - 27 = 102222111112073 is a prime.
It is a super-2 number, since 2×1022221111122012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222111112207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3624040 + ... + 14750521.
It is an arithmetic number, because the mean of its divisors is an integer number (6541968807108).
Almost surely, 2102222111112201 is an apocalyptic number.
It is an amenable number.
102222111112201 is a deficient number, since it is larger than the sum of its proper divisors (2449389801527).
102222111112201 is an equidigital number, since it uses as much as digits as its factorization.
102222111112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18375432.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 102222111112201 its reverse (102211111222201), we get a palindrome (204433222334402).
The spelling of 102222111112201 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred eleven million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •