Base | Representation |
---|---|
bin | 100001001001001… |
… | …0100110010101011 |
3 | 2212111121112102022 |
4 | 1002102110302223 |
5 | 4234144200021 |
6 | 302204055055 |
7 | 36362460041 |
oct | 10222246253 |
9 | 2774545368 |
10 | 1112100011 |
11 | 52082a220 |
12 | 27053448b |
13 | 149529359 |
14 | a79ac391 |
15 | 679761ab |
hex | 42494cab |
1112100011 has 8 divisors (see below), whose sum is σ = 1222754304. Its totient is φ = 1003038120.
The previous prime is 1112099993. The next prime is 1112100023. The reversal of 1112100011 is 1100012111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112100011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1112100811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 396635 + ... + 399428.
It is an arithmetic number, because the mean of its divisors is an integer number (152844288).
Almost surely, 21112100011 is an apocalyptic number.
1112100011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1112100011 is a deficient number, since it is larger than the sum of its proper divisors (110654293).
1112100011 is a wasteful number, since it uses less digits than its factorization.
1112100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 796201.
The product of its (nonzero) digits is 2, while the sum is 8.
The square root of 1112100011 is about 33348.1635326445. The cubic root of 1112100011 is about 1036.0513517253.
Adding to 1112100011 its reverse (1100012111), we get a palindrome (2212112122).
The spelling of 1112100011 in words is "one billion, one hundred twelve million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •