Base | Representation |
---|---|
bin | 1001000111010111010001… |
… | …1011001111101111101001 |
3 | 1022111002211012212021210102 |
4 | 2101311310123033233221 |
5 | 2303200241133013001 |
6 | 33152032241555145 |
7 | 2053034164300442 |
oct | 221656433175751 |
9 | 38432735767712 |
10 | 10022112001001 |
11 | 3214398a48711 |
12 | 115a429045ab5 |
13 | 579109263599 |
14 | 269103b062c9 |
15 | 125a712e6e6b |
hex | 91d746cfbe9 |
10022112001001 has 8 divisors (see below), whose sum is σ = 10043699736960. Its totient is φ = 10000528399008.
The previous prime is 10022112000941. The next prime is 10022112001061. The reversal of 10022112001001 is 10010021122001.
It is an interprime number because it is at equal distance from previous prime (10022112000941) and next prime (10022112001061).
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 10022112001001 - 242 = 5624065489897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10022112001061) 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, 3845165 + ... + 5901653.
It is an arithmetic number, because the mean of its divisors is an integer number (1255462467120).
Almost surely, 210022112001001 is an apocalyptic number.
It is an amenable number.
10022112001001 is a deficient number, since it is larger than the sum of its proper divisors (21587735959).
10022112001001 is a wasteful number, since it uses less digits than its factorization.
10022112001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2066983.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10022112001001 its reverse (10010021122001), we get a palindrome (20032133123002).
The spelling of 10022112001001 in words is "ten trillion, twenty-two billion, one hundred twelve million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •