Base | Representation |
---|---|
bin | 1010000110001000110011… |
… | …11000001101110011000001 |
3 | 2220121101222020022000220012 |
4 | 11003010121320031303001 |
5 | 10402220343222320001 |
6 | 115115015341154305 |
7 | 4450656311235644 |
oct | 503043170156301 |
9 | 86541866260805 |
10 | 22201120120001 |
11 | 708a495586829 |
12 | 25a688625b995 |
13 | c50730c40b74 |
14 | 56a77b887a5b |
15 | 28777e7e52bb |
hex | 143119e0dcc1 |
22201120120001 has 8 divisors (see below), whose sum is σ = 23507258065920. Its totient is φ = 20895003252288.
The previous prime is 22201120119973. The next prime is 22201120120051. The reversal of 22201120120001 is 10002102110222.
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 22201120120001 - 230 = 22200046378177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22201120120051) 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, 3074921 + ... + 7338758.
It is an arithmetic number, because the mean of its divisors is an integer number (2938407258240).
Almost surely, 222201120120001 is an apocalyptic number.
It is an amenable number.
22201120120001 is a deficient number, since it is larger than the sum of its proper divisors (1306137945919).
22201120120001 is a wasteful number, since it uses less digits than its factorization.
22201120120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10539103.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22201120120001 its reverse (10002102110222), we get a palindrome (32203222230223).
The spelling of 22201120120001 in words is "twenty-two trillion, two hundred one billion, one hundred twenty million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •