Base | Representation |
---|---|
bin | 10100011111110011… |
… | …01100010010101110 |
3 | 1001101220100021201001 |
4 | 22033321230102232 |
5 | 140014033400420 |
6 | 5015534110514 |
7 | 536460105031 |
oct | 121771542256 |
9 | 31356307631 |
10 | 11004200110 |
11 | 4737647462 |
12 | 217134b43a |
13 | 1064a68317 |
14 | 765685018 |
15 | 44611db0a |
hex | 28fe6c4ae |
11004200110 has 8 divisors (see below), whose sum is σ = 19807560216. Its totient is φ = 4401680040.
The previous prime is 11004200093. The next prime is 11004200117. The reversal of 11004200110 is 1100240011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1100420011 = 11004200110 / (1 + 1 + 0 + 0 + 4 + 2 + 0 + 0 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11004200117) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 550209996 + ... + 550210015.
It is an arithmetic number, because the mean of its divisors is an integer number (2475945027).
Almost surely, 211004200110 is an apocalyptic number.
11004200110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11004200110 is a deficient number, since it is larger than the sum of its proper divisors (8803360106).
11004200110 is a wasteful number, since it uses less digits than its factorization.
11004200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100420018.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11004200110 its reverse (1100240011), we get a palindrome (12104440121).
The spelling of 11004200110 in words is "eleven billion, four million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •