Base | Representation |
---|---|
bin | 1010000110101100000011… |
… | …0111001001110101001000 |
3 | 1110100002220110210012200112 |
4 | 2201223000313021311020 |
5 | 2424011310401023422 |
6 | 35343512341453452 |
7 | 2224446452201240 |
oct | 241530067116510 |
9 | 43302813705615 |
10 | 11110021111112 |
11 | 35a3808309120 |
12 | 12b5243711288 |
13 | 627894103031 |
14 | 2a5a29492b20 |
15 | 143ee5571ee2 |
hex | a1ac0dc9d48 |
11110021111112 has 64 divisors (see below), whose sum is σ = 26524062627840. Its totient is φ = 4236482203200.
The previous prime is 11110021110977. The next prime is 11110021111127. The reversal of 11110021111112 is 21111112001111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191840714 + ... + 191898617.
It is an arithmetic number, because the mean of its divisors is an integer number (414438478560).
Almost surely, 211110021111112 is an apocalyptic number.
It is an amenable number.
11110021111112 is an abundant number, since it is smaller than the sum of its proper divisors (15414041516728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110021111112 is a wasteful number, since it uses less digits than its factorization.
11110021111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383739402 (or 383739398 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 11110021111112 its reverse (21111112001111), we get a palindrome (32221133112223).
It can be divided in two parts, 111100 and 21111112, that added together give a palindrome (21222212).
The spelling of 11110021111112 in words is "eleven trillion, one hundred ten billion, twenty-one million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •