Base | Representation |
---|---|
bin | 1010000110001000101100… |
… | …00001110100110011011001 |
3 | 2220121101210201202112100101 |
4 | 11003010112001310303121 |
5 | 10402220230203431301 |
6 | 115115005112535401 |
7 | 4450654565234332 |
oct | 503042601646331 |
9 | 86541721675311 |
10 | 22201055530201 |
11 | 708a462080529 |
12 | 25a68686b1561 |
13 | c50720747a52 |
14 | 56a773073289 |
15 | 287778cd7701 |
hex | 143116074cd9 |
22201055530201 has 8 divisors (see below), whose sum is σ = 23507047355904. Its totient is φ = 20895068969280.
The previous prime is 22201055530163. The next prime is 22201055530223. The reversal of 22201055530201 is 10203555010222.
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 22201055530201 - 215 = 22201055497433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22201055530201.
It is not an unprimeable number, because it can be changed into a prime (22201055530261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10289656 + ... + 12258838.
It is an arithmetic number, because the mean of its divisors is an integer number (2938380919488).
Almost surely, 222201055530201 is an apocalyptic number.
It is an amenable number.
22201055530201 is a deficient number, since it is larger than the sum of its proper divisors (1305991825703).
22201055530201 is a wasteful number, since it uses less digits than its factorization.
22201055530201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2632391.
The product of its (nonzero) digits is 6000, while the sum is 28.
The spelling of 22201055530201 in words is "twenty-two trillion, two hundred one billion, fifty-five million, five hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •