Base | Representation |
---|---|
bin | 1010000011001110010101… |
… | …11010100111000111000101 |
3 | 2220020211120110111220110102 |
4 | 11001213022322213013011 |
5 | 10344100332320200401 |
6 | 115001021521333445 |
7 | 4440513441510113 |
oct | 501471272470705 |
9 | 86224513456412 |
10 | 22101011100101 |
11 | 7050a9365943a |
12 | 258b3a7a97285 |
13 | c4416898020b |
14 | 5659a2168ab3 |
15 | 284d70c2356b |
hex | 1419caea71c5 |
22101011100101 has 8 divisors (see below), whose sum is σ = 22149625104000. Its totient is φ = 22052400888672.
The previous prime is 22101011100083. The next prime is 22101011100121. The reversal of 22101011100101 is 10100111010122.
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 22101011100101 - 218 = 22101010837957 is a prime.
It is a super-2 number, since 2×221010111001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22101011100121) 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, 10882025 + ... + 12752273.
It is an arithmetic number, because the mean of its divisors is an integer number (2768703138000).
Almost surely, 222101011100101 is an apocalyptic number.
It is an amenable number.
22101011100101 is a deficient number, since it is larger than the sum of its proper divisors (48614003899).
22101011100101 is a wasteful number, since it uses less digits than its factorization.
22101011100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1896235.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 22101011100101 its reverse (10100111010122), we get a palindrome (32201122110223).
The spelling of 22101011100101 in words is "twenty-two trillion, one hundred one billion, eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •