Base | Representation |
---|---|
bin | 110011001110011000… |
… | …0011000001100110011 |
3 | 101111221101010210102011 |
4 | 1212130300120030303 |
5 | 3300242023011011 |
6 | 122311333503351 |
7 | 10643001336226 |
oct | 1463460301463 |
9 | 344841123364 |
10 | 110004110131 |
11 | 4271a4a8113 |
12 | 193a01a1b57 |
13 | a4b1308936 |
14 | 54779735bd |
15 | 2cdc65a621 |
hex | 199cc18333 |
110004110131 has 8 divisors (see below), whose sum is σ = 114794083584. Its totient is φ = 105214735560.
The previous prime is 110004110129. The next prime is 110004110159. The reversal of 110004110131 is 131011400011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110004110131 - 21 = 110004110129 is a prime.
It is a super-2 number, since 2×1100041101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (110004110101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248170 + ... + 530656.
It is an arithmetic number, because the mean of its divisors is an integer number (14349260448).
Almost surely, 2110004110131 is an apocalyptic number.
110004110131 is a deficient number, since it is larger than the sum of its proper divisors (4789973453).
110004110131 is a wasteful number, since it uses less digits than its factorization.
110004110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299441.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110004110131 its reverse (131011400011), we get a palindrome (241015510142).
The spelling of 110004110131 in words is "one hundred ten billion, four million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •