Base | Representation |
---|---|
bin | 10100011111111001… |
… | …10010000010111110 |
3 | 1001101221212102211001 |
4 | 22033330302002332 |
5 | 140014240310420 |
6 | 5020003320514 |
7 | 536500020403 |
oct | 121774620276 |
9 | 31357772731 |
10 | 11005010110 |
11 | 473804aa86 |
12 | 217168013a |
13 | 1064c8cc03 |
14 | 7658162aa |
15 | 44622db0a |
hex | 28ff320be |
11005010110 has 16 divisors (see below), whose sum is σ = 19984321296. Its totient is φ = 4363047808.
The previous prime is 11005010101. The next prime is 11005010119. The reversal of 11005010110 is 1101050011.
It is an interprime number because it is at equal distance from previous prime (11005010101) and next prime (11005010119).
It is a super-2 number, since 2×110050101102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11005010119) 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 7 ways as a sum of consecutive naturals, for example, 4868344 + ... + 4870603.
It is an arithmetic number, because the mean of its divisors is an integer number (1249020081).
Almost surely, 211005010110 is an apocalyptic number.
11005010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11005010110 is a deficient number, since it is larger than the sum of its proper divisors (8979311186).
11005010110 is a wasteful number, since it uses less digits than its factorization.
11005010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9739067.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 11005010110 its reverse (1101050011), we get a palindrome (12106060121).
The spelling of 11005010110 in words is "eleven billion, five million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •