Base | Representation |
---|---|
bin | 10111001111100001111011… |
… | …111100111100110010110110 |
3 | 111101221100121221010102102010 |
4 | 113033201323330330302312 |
5 | 101344302233103020042 |
6 | 1001224135450225050 |
7 | 30350213626633434 |
oct | 2717417374746266 |
9 | 441840557112363 |
10 | 102222301220022 |
11 | 2a631264121905 |
12 | b56b449a25186 |
13 | 45066a2085659 |
14 | 1b3582b533d54 |
15 | bc4083a0059c |
hex | 5cf87bf3ccb6 |
102222301220022 has 8 divisors (see below), whose sum is σ = 204444602440056. Its totient is φ = 34074100406672.
The previous prime is 102222301219999. The next prime is 102222301220051. The reversal of 102222301220022 is 220022103222201.
It is a sphenic number, since it is the product of 3 distinct primes.
102222301220022 is an admirable number.
It is a super-2 number, since 2×1022223012200222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8518525101663 + ... + 8518525101674.
It is an arithmetic number, because the mean of its divisors is an integer number (25555575305007).
Almost surely, 2102222301220022 is an apocalyptic number.
102222301220022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102222301220022 is a wasteful number, since it uses less digits than its factorization.
102222301220022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17037050203342.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 102222301220022 its reverse (220022103222201), we get a palindrome (322244404442223).
The spelling of 102222301220022 in words is "one hundred two trillion, two hundred twenty-two billion, three hundred one million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •