Base | Representation |
---|---|
bin | 1010000110000110111010… |
… | …01001010110010001111011 |
3 | 2220121022100020000120211010 |
4 | 11003003131021112101323 |
5 | 10402211301401413034 |
6 | 115114330302205003 |
7 | 4450622126460450 |
oct | 503033511262173 |
9 | 86538306016733 |
10 | 22200101201019 |
11 | 708a012410925 |
12 | 25a6640b83763 |
13 | c505cab0b621 |
14 | 56a6c2413827 |
15 | 2877201283e9 |
hex | 1430dd25647b |
22200101201019 has 16 divisors (see below), whose sum is σ = 35609184884480. Its totient is φ = 12018099898080.
The previous prime is 22200101201011. The next prime is 22200101201039. The reversal of 22200101201019 is 91010210100222.
It is not a de Polignac number, because 22200101201019 - 23 = 22200101201011 is a prime.
It is a super-4 number, since 4×222001012010194 (a number of 54 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22200101200986 and 22200101201004.
It is not an unprimeable number, because it can be changed into a prime (22200101201011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27819675292 + ... + 27819676089.
It is an arithmetic number, because the mean of its divisors is an integer number (2225574055280).
Almost surely, 222200101201019 is an apocalyptic number.
22200101201019 is a deficient number, since it is larger than the sum of its proper divisors (13409083683461).
22200101201019 is a wasteful number, since it uses less digits than its factorization.
22200101201019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55639351410.
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 22200101201019 in words is "twenty-two trillion, two hundred billion, one hundred one million, two hundred one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •