Base | Representation |
---|---|
bin | 1101101010000… |
… | …01000101111101 |
3 | 21222120022201000 |
4 | 12311001011331 |
5 | 213311431110 |
6 | 15211240513 |
7 | 2560520160 |
oct | 665010575 |
9 | 258508630 |
10 | 114561405 |
11 | 59737752 |
12 | 32449139 |
13 | 1a97161a |
14 | 11301ad7 |
15 | a0ce1c0 |
hex | 6d4117d |
114561405 has 32 divisors (see below), whose sum is σ = 232761600. Its totient is φ = 52370496.
The previous prime is 114561389. The next prime is 114561407. The reversal of 114561405 is 504165411.
114561405 is a `hidden beast` number, since 1 + 1 + 45 + 614 + 0 + 5 = 666.
It is not a de Polignac number, because 114561405 - 24 = 114561389 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114561407) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59670 + ... + 61559.
It is an arithmetic number, because the mean of its divisors is an integer number (7273800).
Almost surely, 2114561405 is an apocalyptic number.
114561405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
114561405 is an abundant number, since it is smaller than the sum of its proper divisors (118200195).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114561405 is a wasteful number, since it uses less digits than its factorization.
114561405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121250 (or 121244 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 114561405 is about 10703.3361621506. The cubic root of 114561405 is about 485.6754043477.
The spelling of 114561405 in words is "one hundred fourteen million, five hundred sixty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •