Base | Representation |
---|---|
bin | 1101101110001… |
… | …11001000000001 |
3 | 22000121012210012 |
4 | 12313013020001 |
5 | 213432013101 |
6 | 15231114305 |
7 | 2565264560 |
oct | 667071001 |
9 | 260535705 |
10 | 115110401 |
11 | 59a8216a |
12 | 32672995 |
13 | 1ab04483 |
14 | 11405bd7 |
15 | a18bbbb |
hex | 6dc7201 |
115110401 has 4 divisors (see below), whose sum is σ = 131554752. Its totient is φ = 98666052.
The previous prime is 115110361. The next prime is 115110419. The reversal of 115110401 is 104011511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 104011511 = 131 ⋅793981.
It is a cyclic number.
It is not a de Polignac number, because 115110401 - 26 = 115110337 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (115110421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8222165 + ... + 8222178.
It is an arithmetic number, because the mean of its divisors is an integer number (32888688).
Almost surely, 2115110401 is an apocalyptic number.
It is an amenable number.
115110401 is a deficient number, since it is larger than the sum of its proper divisors (16444351).
115110401 is an equidigital number, since it uses as much as digits as its factorization.
115110401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16444350.
The product of its (nonzero) digits is 20, while the sum is 14.
The square root of 115110401 is about 10728.9515331182. The cubic root of 115110401 is about 486.4499789603.
Adding to 115110401 its reverse (104011511), we get a palindrome (219121912).
It can be divided in two parts, 115110 and 401, that added together give a palindrome (115511).
The spelling of 115110401 in words is "one hundred fifteen million, one hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •