Base | Representation |
---|---|
bin | 10111001100100111100110… |
… | …001111111001111101000111 |
3 | 111101020020012000002210011000 |
4 | 113030213212033321331013 |
5 | 101333013002101023421 |
6 | 1000552210015144343 |
7 | 30326601514030650 |
oct | 2714474617717507 |
9 | 441206160083130 |
10 | 102022221111111 |
11 | 2a5644211156a4 |
12 | b53870b5150b3 |
13 | 44c0867298672 |
14 | 1b29c8a95c527 |
15 | bbdc73505226 |
hex | 5cc9e63f9f47 |
102022221111111 has 512 divisors, whose sum is σ = 195251503104000. Its totient is φ = 51322794393600.
The previous prime is 102022221111091. The next prime is 102022221111119. The reversal of 102022221111111 is 111111122220201.
It is a happy number.
It is not a de Polignac number, because 102022221111111 - 25 = 102022221111079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022221111119) 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 in 511 ways as a sum of consecutive naturals, for example, 90365119995 + ... + 90365121123.
It is an arithmetic number, because the mean of its divisors is an integer number (381350592000).
Almost surely, 2102022221111111 is an apocalyptic number.
102022221111111 is a deficient number, since it is larger than the sum of its proper divisors (93229281992889).
102022221111111 is a wasteful number, since it uses less digits than its factorization.
102022221111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1500 (or 1494 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 102022221111111 its reverse (111111122220201), we get a palindrome (213133343331312).
The spelling of 102022221111111 in words is "one hundred two trillion, twenty-two billion, two hundred twenty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •