Base | Representation |
---|---|
bin | 101111100110000110… |
… | …0101000101000010110 |
3 | 100202211012100122222112 |
4 | 1133030030220220112 |
5 | 3133311242041042 |
6 | 114542113231022 |
7 | 10245601421534 |
oct | 1371414505026 |
9 | 322735318875 |
10 | 102210112022 |
11 | 3a38aa41a67 |
12 | 17985b62472 |
13 | 983b671935 |
14 | 4d387b1154 |
15 | 29d32a2982 |
hex | 17cc328a16 |
102210112022 has 8 divisors (see below), whose sum is σ = 159981044976. Its totient is φ = 48883097032.
The previous prime is 102210112021. The next prime is 102210112031. The reversal of 102210112022 is 220211012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×1022101120224 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a junction number, because it is equal to n+sod(n) for n = 102210111988 and 102210112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102210112021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1110979433 + ... + 1110979524.
It is an arithmetic number, because the mean of its divisors is an integer number (19997630622).
Almost surely, 2102210112022 is an apocalyptic number.
102210112022 is a deficient number, since it is larger than the sum of its proper divisors (57770932954).
102210112022 is a wasteful number, since it uses less digits than its factorization.
102210112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2221958982.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102210112022 its reverse (220211012201), we get a palindrome (322421124223).
The spelling of 102210112022 in words is "one hundred two billion, two hundred ten million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •