Base | Representation |
---|---|
bin | 1010000110110011011101… |
… | …1010111101101101000000 |
3 | 1110100022001002121220112212 |
4 | 2201230313122331231000 |
5 | 2424024344103210422 |
6 | 35344441555041252 |
7 | 2224546654231550 |
oct | 241546732755500 |
9 | 43308032556485 |
10 | 11112010210112 |
11 | 35a463908a699 |
12 | 12b56b98a0228 |
13 | 627b202316a6 |
14 | 2a5b77711160 |
15 | 1440aeece9e2 |
hex | a1b376bdb40 |
11112010210112 has 28 divisors (see below), whose sum is σ = 25200451727520. Its totient is φ = 4762290089856.
The previous prime is 11112010210061. The next prime is 11112010210117. The reversal of 11112010210112 is 21101201021111.
It is a tau number, because it is divible by the number of its divisors (28).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112010210117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12401796662 + ... + 12401797557.
Almost surely, 211112010210112 is an apocalyptic number.
It is an amenable number.
11112010210112 is an abundant number, since it is smaller than the sum of its proper divisors (14088441517408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112010210112 is an equidigital number, since it uses as much as digits as its factorization.
11112010210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24803594238 (or 24803594228 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11112010210112 its reverse (21101201021111), we get a palindrome (32213211231223).
The spelling of 11112010210112 in words is "eleven trillion, one hundred twelve billion, ten million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •