Base | Representation |
---|---|
bin | 1001100110101110111110… |
… | …11001001000100001101010 |
3 | 2202210020211121112101122101 |
4 | 10303113133121020201222 |
5 | 10232031031114231442 |
6 | 112531205412244014 |
7 | 4310010244353640 |
oct | 463273731104152 |
9 | 82706747471571 |
10 | 21122102102122 |
11 | 6803918a9152a |
12 | 245173131060a |
13 | ba2a6210c538 |
14 | 53045ac83190 |
15 | 26967add2cb7 |
hex | 1335df64886a |
21122102102122 has 8 divisors (see below), whose sum is σ = 36209317889376. Its totient is φ = 9052329472332.
The previous prime is 21122102102113. The next prime is 21122102102147. The reversal of 21122102102122 is 22120120122112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×211221021021222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21122102102122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 754360789348 + ... + 754360789375.
It is an arithmetic number, because the mean of its divisors is an integer number (4526164736172).
Almost surely, 221122102102122 is an apocalyptic number.
21122102102122 is a deficient number, since it is larger than the sum of its proper divisors (15087215787254).
21122102102122 is a wasteful number, since it uses less digits than its factorization.
21122102102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1508721578732.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21122102102122 its reverse (22120120122112), we get a palindrome (43242222224234).
The spelling of 21122102102122 in words is "twenty-one trillion, one hundred twenty-two billion, one hundred two million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •