Base | Representation |
---|---|
bin | 1101001010010… |
… | …01001000011111 |
3 | 21200201220101001 |
4 | 12211021020133 |
5 | 211230300111 |
6 | 14542131131 |
7 | 2510245660 |
oct | 645111037 |
9 | 250656331 |
10 | 110400031 |
11 | 573551a5 |
12 | 30b80aa7 |
13 | 19b45481 |
14 | 1093b367 |
15 | 9a5b1c1 |
hex | 694921f |
110400031 has 4 divisors (see below), whose sum is σ = 126171472. Its totient is φ = 94628592.
The previous prime is 110400019. The next prime is 110400041. The reversal of 110400031 is 130004011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110400031 - 25 = 110399999 is a prime.
It is a super-2 number, since 2×1104000312 = 24376333689601922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110399990 and 110400017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110400001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7885710 + ... + 7885723.
It is an arithmetic number, because the mean of its divisors is an integer number (31542868).
Almost surely, 2110400031 is an apocalyptic number.
110400031 is a deficient number, since it is larger than the sum of its proper divisors (15771441).
110400031 is an equidigital number, since it uses as much as digits as its factorization.
110400031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15771440.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 110400031 is about 10507.1419044381. The cubic root of 110400031 is about 479.7221062175.
Adding to 110400031 its reverse (130004011), we get a palindrome (240404042).
The spelling of 110400031 in words is "one hundred ten million, four hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •