Base | Representation |
---|---|
bin | 10111001111100001110111… |
… | …001011101100111100111011 |
3 | 111101221100102100120001020110 |
4 | 113033201313023230330323 |
5 | 101344302102111414321 |
6 | 1001224123511155403 |
7 | 30350211635531436 |
oct | 2717416713547473 |
9 | 441840370501213 |
10 | 102222221201211 |
11 | 2a631222a38561 |
12 | b56b427075b63 |
13 | 450668b619847 |
14 | 1b35820a6481d |
15 | bc407b996176 |
hex | 5cf8772ecf3b |
102222221201211 has 8 divisors (see below), whose sum is σ = 136296361384960. Its totient is φ = 68148114242472.
The previous prime is 102222221201189. The next prime is 102222221201249. The reversal of 102222221201211 is 112102122222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102222221201211 - 26 = 102222221201147 is a prime.
It is a super-3 number, since 3×1022222212012113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222211201211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83106 + ... + 14298648.
It is an arithmetic number, because the mean of its divisors is an integer number (17037045173120).
Almost surely, 2102222221201211 is an apocalyptic number.
102222221201211 is a deficient number, since it is larger than the sum of its proper divisors (34074140183749).
102222221201211 is a wasteful number, since it uses less digits than its factorization.
102222221201211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16612505.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 102222221201211 its reverse (112102122222201), we get a palindrome (214324343423412).
The spelling of 102222221201211 in words is "one hundred two trillion, two hundred twenty-two billion, two hundred twenty-one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •