Base | Representation |
---|---|
bin | 1001100110101110111110… |
… | …10001100100100111010110 |
3 | 2202210020211110210200201021 |
4 | 10303113133101210213112 |
5 | 10232031030112320042 |
6 | 112531205301551354 |
7 | 4310010221460136 |
oct | 463273721444726 |
9 | 82706743720637 |
10 | 21122100120022 |
11 | 6803917958330 |
12 | 245173071555a |
13 | ba2a618972b5 |
14 | 53045a8c8ac6 |
15 | 26967ab40867 |
hex | 1335df4649d6 |
21122100120022 has 8 divisors (see below), whose sum is σ = 34563436560072. Its totient is φ = 9600954600000.
The previous prime is 21122100120001. The next prime is 21122100120047. The reversal of 21122100120022 is 22002100122112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×211221001200222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21122100119978 and 21122100120005.
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, 480047729979 + ... + 480047730022.
It is an arithmetic number, because the mean of its divisors is an integer number (4320429570009).
Almost surely, 221122100120022 is an apocalyptic number.
21122100120022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21122100120022 is a deficient number, since it is larger than the sum of its proper divisors (13441336440050).
21122100120022 is a wasteful number, since it uses less digits than its factorization.
21122100120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960095460014.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21122100120022 its reverse (22002100122112), we get a palindrome (43124200242134).
The spelling of 21122100120022 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •