Base | Representation |
---|---|
bin | 10100101100011100… |
… | …01010110001000110 |
3 | 1001200021212012220010 |
4 | 22112032022301012 |
5 | 140223204343420 |
6 | 5034242451050 |
7 | 542215256226 |
oct | 122616126106 |
9 | 31607765803 |
10 | 11110231110 |
11 | 4791488090 |
12 | 21a0963a86 |
13 | 1080a10c64 |
14 | 7757a6086 |
15 | 4505b54e0 |
hex | 29638ac46 |
11110231110 has 96 divisors (see below), whose sum is σ = 29328106752. Its totient is φ = 2671298560.
The previous prime is 11110231091. The next prime is 11110231147. The reversal of 11110231110 is 1113201111.
It is a super-2 number, since 2×111102311102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24744166 + ... + 24744614.
It is an arithmetic number, because the mean of its divisors is an integer number (305501112).
Almost surely, 211110231110 is an apocalyptic number.
11110231110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11110231110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14664053376).
11110231110 is an abundant number, since it is smaller than the sum of its proper divisors (18217875642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110231110 is a wasteful number, since it uses less digits than its factorization.
11110231110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086 (or 637 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 11110231110 its reverse (1113201111), we get a palindrome (12223432221).
The spelling of 11110231110 in words is "eleven billion, one hundred ten million, two hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •