Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0101111110111001111 |
3 | 101112012202121022022220 |
4 | 1212203010233313033 |
5 | 3301001142110411 |
6 | 122330041510423 |
7 | 10645426343166 |
oct | 1464304576717 |
9 | 345182538286 |
10 | 110110113231 |
11 | 42774319888 |
12 | 1940b7a2413 |
13 | a4ca271971 |
14 | 5487a883dd |
15 | 2ce6ae8b06 |
hex | 19a312fdcf |
110110113231 has 8 divisors (see below), whose sum is σ = 147131953584. Its totient is φ = 73247507520.
The previous prime is 110110113199. The next prime is 110110113233. The reversal of 110110113231 is 132311011011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110110113231 - 25 = 110110113199 is a prime.
It is a super-3 number, since 3×1101101132313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 110110113231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110113233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39807046 + ... + 39809811.
It is an arithmetic number, because the mean of its divisors is an integer number (18391494198).
Almost surely, 2110110113231 is an apocalyptic number.
110110113231 is a deficient number, since it is larger than the sum of its proper divisors (37021840353).
110110113231 is an equidigital number, since it uses as much as digits as its factorization.
110110113231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79617321.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 110110113231 its reverse (132311011011), we get a palindrome (242421124242).
The spelling of 110110113231 in words is "one hundred ten billion, one hundred ten million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •