Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …01101001111001110100001 |
3 | 2212220101001202002121121111 |
4 | 11000022332231033032201 |
5 | 10340440120114120001 |
6 | 114443331150023321 |
7 | 4430410421303002 |
oct | 500127655171641 |
9 | 85811052077544 |
10 | 22002022020001 |
11 | 7013006925431 |
12 | 25741807a7b41 |
13 | c37a2173213a |
14 | 560c914991a9 |
15 | 2824ca625851 |
hex | 1402beb4f3a1 |
22002022020001 has 4 divisors (see below), whose sum is σ = 22025503367812. Its totient is φ = 21978540672192.
The previous prime is 22002022019981. The next prime is 22002022020023. The reversal of 22002022020001 is 10002022020022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6807929858401 + 15194092161600 = 2609201^2 + 3897960^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002022020001 - 25 = 22002022019969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22002022020061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11740672500 + ... + 11740674373.
It is an arithmetic number, because the mean of its divisors is an integer number (5506375841953).
Almost surely, 222002022020001 is an apocalyptic number.
It is an amenable number.
22002022020001 is a deficient number, since it is larger than the sum of its proper divisors (23481347811).
22002022020001 is an equidigital number, since it uses as much as digits as its factorization.
22002022020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23481347810.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 22002022020001 its reverse (10002022020022), we get a palindrome (32004044040023).
The spelling of 22002022020001 in words is "twenty-two trillion, two billion, twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •