Base | Representation |
---|---|
bin | 1010000011010000010111… |
… | …10100100000111110000010 |
3 | 2220020221101100111211021121 |
4 | 11001220023310200332002 |
5 | 10344110100101133442 |
6 | 115001321540542454 |
7 | 4440552433261012 |
oct | 501501364407602 |
9 | 86227340454247 |
10 | 22102100021122 |
11 | 70514a2296970 |
12 | 258b6506b1a2a |
13 | c442b0452194 |
14 | 565a66a21c42 |
15 | 284dd661b967 |
hex | 141a0bd20f82 |
22102100021122 has 8 divisors (see below), whose sum is σ = 36167072761872. Its totient is φ = 10046409100500.
The previous prime is 22102100021077. The next prime is 22102100021149. The reversal of 22102100021122 is 22112000120122.
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×221021000211222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22102100021096 and 22102100021105.
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, 502320455004 + ... + 502320455047.
It is an arithmetic number, because the mean of its divisors is an integer number (4520884095234).
Almost surely, 222102100021122 is an apocalyptic number.
22102100021122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22102100021122 is a deficient number, since it is larger than the sum of its proper divisors (14064972740750).
22102100021122 is a wasteful number, since it uses less digits than its factorization.
22102100021122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004640910064.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22102100021122 its reverse (22112000120122), we get a palindrome (44214100141244).
The spelling of 22102100021122 in words is "twenty-two trillion, one hundred two billion, one hundred million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •