Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …111000100001100001110 |
3 | 10221022021022222120011002 |
4 | 100023220133010030032 |
5 | 121204340004120420 |
6 | 2210502514300302 |
7 | 143224306133552 |
oct | 20135037041416 |
9 | 3838238876132 |
10 | 1112002020110 |
11 | 399663172383 |
12 | 15b61b287692 |
13 | 80b27499417 |
14 | 3bb6d48d862 |
15 | 1ddd44c0075 |
hex | 102e87c430e |
1112002020110 has 8 divisors (see below), whose sum is σ = 2001603636216. Its totient is φ = 444800808040.
The previous prime is 1112002020083. The next prime is 1112002020119. The reversal of 1112002020110 is 110202002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1112002020091 and 1112002020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112002020119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55600100996 + ... + 55600101015.
It is an arithmetic number, because the mean of its divisors is an integer number (250200454527).
Almost surely, 21112002020110 is an apocalyptic number.
1112002020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112002020110 is a deficient number, since it is larger than the sum of its proper divisors (889601616106).
1112002020110 is a wasteful number, since it uses less digits than its factorization.
1112002020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111200202018.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1112002020110 its reverse (110202002111), we get a palindrome (1222204022221).
The spelling of 1112002020110 in words is "one trillion, one hundred twelve billion, two million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •