Base | Representation |
---|---|
bin | 10100100110100001… |
… | …011000010011111110 |
3 | 2010002122210101021121 |
4 | 110212201120103332 |
5 | 330301001333042 |
6 | 14055020221154 |
7 | 1412116266130 |
oct | 244641302376 |
9 | 63078711247 |
10 | 22121121022 |
11 | 9421883700 |
12 | 435439a7ba |
13 | 2116c7c230 |
14 | 10dbcad050 |
15 | 8970a6367 |
hex | 5268584fe |
22121121022 has 48 divisors (see below), whose sum is σ = 44889185376. Its totient is φ = 7955640000.
The previous prime is 22121121007. The next prime is 22121121023. The reversal of 22121121022 is 22012112122.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 22121120987 and 22121121005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22121121023) 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 23 ways as a sum of consecutive naturals, for example, 480229 + ... + 524272.
It is an arithmetic number, because the mean of its divisors is an integer number (935191362).
Almost surely, 222121121022 is an apocalyptic number.
22121121022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22121121022 is an abundant number, since it is smaller than the sum of its proper divisors (22768064354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22121121022 is a wasteful number, since it uses less digits than its factorization.
22121121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004545 (or 1004534 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22121121022 its reverse (22012112122), we get a palindrome (44133233144).
The spelling of 22121121022 in words is "twenty-two billion, one hundred twenty-one million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •