Base | Representation |
---|---|
bin | 1001101001101001000011… |
… | …11001011000111100000110 |
3 | 2210010210200211000012112200 |
4 | 10310310201321120330012 |
5 | 10240200130014231042 |
6 | 113045130404055330 |
7 | 4320144665346651 |
oct | 464644171307406 |
9 | 83123624005480 |
10 | 21222002102022 |
11 | 6842222a26017 |
12 | 2468b71694546 |
13 | bac2c2ca8407 |
14 | 535216912898 |
15 | 26c076467c4c |
hex | 134d21e58f06 |
21222002102022 has 48 divisors (see below), whose sum is σ = 46123275428880. Its totient is φ = 7052118183936.
The previous prime is 21222002102017. The next prime is 21222002102111. The reversal of 21222002102022 is 22020120022212.
21222002102022 is a `hidden beast` number, since 212 + 2 + 200 + 210 + 20 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21222002101986 and 21222002102004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48668838 + ... + 49102950.
It is an arithmetic number, because the mean of its divisors is an integer number (960901571435).
Almost surely, 221222002102022 is an apocalyptic number.
21222002102022 is an abundant number, since it is smaller than the sum of its proper divisors (24901273326858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21222002102022 is a wasteful number, since it uses less digits than its factorization.
21222002102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442517 (or 442514 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 21222002102022 its reverse (22020120022212), we get a palindrome (43242122124234).
The spelling of 21222002102022 in words is "twenty-one trillion, two hundred twenty-two billion, two million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •