Base | Representation |
---|---|
bin | 11001011111010011000111… |
… | …111001101000110100101001 |
3 | 112200220211212010202201021102 |
4 | 121133103013321220310221 |
5 | 104143134344022413001 |
6 | 1034230540431051145 |
7 | 32420050032443126 |
oct | 3137230771506451 |
9 | 480824763681242 |
10 | 112102000201001 |
11 | 327a0211690758 |
12 | 106a6151070ab5 |
13 | 4a7223385cc45 |
14 | 1d97aa135d74d |
15 | ce606c32be6b |
hex | 65f4c7e68d29 |
112102000201001 has 8 divisors (see below), whose sum is σ = 115719112982784. Its totient is φ = 108484944870960.
The previous prime is 112102000200991. The next prime is 112102000201013. The reversal of 112102000201001 is 100102000201211.
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 112102000201001 - 230 = 112100926459177 is a prime.
It is a super-3 number, since 3×1121020002010013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112102000201021) 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, 10379966 + ... + 18219431.
It is an arithmetic number, because the mean of its divisors is an integer number (14464889122848).
Almost surely, 2112102000201001 is an apocalyptic number.
It is an amenable number.
112102000201001 is a deficient number, since it is larger than the sum of its proper divisors (3617112781783).
112102000201001 is a wasteful number, since it uses less digits than its factorization.
112102000201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28725871.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112102000201001 its reverse (100102000201211), we get a palindrome (212204000402212).
The spelling of 112102000201001 in words is "one hundred twelve trillion, one hundred two billion, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.280 sec. • engine limits •