Base | Representation |
---|---|
bin | 1010000011001100011111… |
… | …10110101000001001001101 |
3 | 2220020202000101221222002011 |
4 | 11001212033312220021031 |
5 | 10344041320132400023 |
6 | 115000335323101221 |
7 | 4440450050136430 |
oct | 501461766501115 |
9 | 86222011858064 |
10 | 22100020200013 |
11 | 7050625290548 |
12 | 258b170071811 |
13 | c4403b5aacc2 |
14 | 56590a709817 |
15 | 284d13c3d50d |
hex | 14198fda824d |
22100020200013 has 8 divisors (see below), whose sum is σ = 25323111548928. Its totient is φ = 18893415252624.
The previous prime is 22100020199963. The next prime is 22100020200053. The reversal of 22100020200013 is 31000202000122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22100020200013 - 217 = 22100020068941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22100020199966 and 22100020200002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22100020200053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4121597506 + ... + 4121602867.
It is an arithmetic number, because the mean of its divisors is an integer number (3165388943616).
Almost surely, 222100020200013 is an apocalyptic number.
It is an amenable number.
22100020200013 is a deficient number, since it is larger than the sum of its proper divisors (3223091348915).
22100020200013 is an equidigital number, since it uses as much as digits as its factorization.
22100020200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8243200763.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 22100020200013 its reverse (31000202000122), we get a palindrome (53100222200135).
The spelling of 22100020200013 in words is "twenty-two trillion, one hundred billion, twenty million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •