Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …110100011010110110001001 |
3 | 112200121001200011011220122102 |
4 | 121131331202310122312021 |
5 | 104140133201131133001 |
6 | 1034120422325403145 |
7 | 32410314642006533 |
oct | 3135754264326611 |
9 | 480531604156572 |
10 | 112010110021001 |
11 | 32765248011435 |
12 | 106903872694b5 |
13 | 4a6667b264a7a |
14 | 1d934653d2853 |
15 | ce3990081e6b |
hex | 65df62d1ad89 |
112010110021001 has 8 divisors (see below), whose sum is σ = 112061615277600. Its totient is φ = 111958612093440.
The previous prime is 112010110020997. The next prime is 112010110021091. The reversal of 112010110021001 is 100120011010211.
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 112010110021001 - 22 = 112010110020997 is a prime.
It is a super-2 number, since 2×1120101100210012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112010110021091) 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, 28858970 + ... + 32509388.
It is an arithmetic number, because the mean of its divisors is an integer number (14007701909700).
Almost surely, 2112010110021001 is an apocalyptic number.
It is an amenable number.
112010110021001 is a deficient number, since it is larger than the sum of its proper divisors (51505256599).
112010110021001 is a wasteful number, since it uses less digits than its factorization.
112010110021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3664519.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112010110021001 its reverse (100120011010211), we get a palindrome (212130121031212).
The spelling of 112010110021001 in words is "one hundred twelve trillion, ten billion, one hundred ten million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •