Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …110100010010001000000110 |
3 | 112102111002200022212010212111 |
4 | 121000233130310102020012 |
5 | 103404233311200023420 |
6 | 1025542134521411234 |
7 | 32112250612255102 |
oct | 3100573464221006 |
9 | 472432608763774 |
10 | 110002112111110 |
11 | 320606a75a056a |
12 | 10407190939b1a |
13 | 494c201a3ca4b |
14 | 1d241b8660902 |
15 | cab619d6d45a |
hex | 640bdcd12206 |
110002112111110 has 64 divisors (see below), whose sum is σ = 207336731512320. Its totient is φ = 41940520357120.
The previous prime is 110002112111071. The next prime is 110002112111161. The reversal of 110002112111110 is 11111211200011.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 76418106 + ... + 77844274.
It is an arithmetic number, because the mean of its divisors is an integer number (3239636429880).
Almost surely, 2110002112111110 is an apocalyptic number.
110002112111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110002112111110 is a deficient number, since it is larger than the sum of its proper divisors (97334619401210).
110002112111110 is a wasteful number, since it uses less digits than its factorization.
110002112111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427373.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110002112111110 its reverse (11111211200011), we get a palindrome (121113323311121).
The spelling of 110002112111110 in words is "one hundred ten trillion, two billion, one hundred twelve million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •