Base | Representation |
---|---|
bin | 11001011101110110000101… |
… | …100000010010000100010101 |
3 | 112200120022000001200210220022 |
4 | 121131312011200102010111 |
5 | 104140020301103311013 |
6 | 1034113015542114525 |
7 | 32406612333023216 |
oct | 3135660540220425 |
9 | 480508001623808 |
10 | 112002102010133 |
11 | 32761908772335 |
12 | 1068a91141ba45 |
13 | 4a659a31785ba |
14 | 1d92d05a4140d |
15 | ce3672003008 |
hex | 65dd85812115 |
112002102010133 has 16 divisors (see below), whose sum is σ = 116711844724272. Its totient is φ = 107389532160000.
The previous prime is 112002102010129. The next prime is 112002102010147. The reversal of 112002102010133 is 331010201200211.
It can be written as a sum of positive squares in 8 ways, for example, as 68303894156689 + 43698207853444 = 8264617^2 + 6610462^2 .
It is a cyclic number.
It is not a de Polignac number, because 112002102010133 - 22 = 112002102010129 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002102010103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15640316 + ... + 21647717.
It is an arithmetic number, because the mean of its divisors is an integer number (7294490295267).
Almost surely, 2112002102010133 is an apocalyptic number.
It is an amenable number.
112002102010133 is a deficient number, since it is larger than the sum of its proper divisors (4709742714139).
112002102010133 is a wasteful number, since it uses less digits than its factorization.
112002102010133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37289336.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112002102010133 its reverse (331010201200211), we get a palindrome (443012303210344).
The spelling of 112002102010133 in words is "one hundred twelve trillion, two billion, one hundred two million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •