Base | Representation |
---|---|
bin | 1101101101011… |
… | …00100001010000 |
3 | 22000101200022000 |
4 | 12312230201100 |
5 | 213420021144 |
6 | 15224514000 |
7 | 2564332056 |
oct | 666544120 |
9 | 260350260 |
10 | 115001424 |
11 | 59a082aa |
12 | 3261b900 |
13 | 1aa969a5 |
14 | 113b81d6 |
15 | a169769 |
hex | 6dac850 |
115001424 has 80 divisors (see below), whose sum is σ = 331377600. Its totient is φ = 38185344.
The previous prime is 115001407. The next prime is 115001437. The reversal of 115001424 is 424100511.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 115001397 and 115001406.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 219627 + ... + 220149.
It is an arithmetic number, because the mean of its divisors is an integer number (4142220).
Almost surely, 2115001424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115001424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165688800).
115001424 is an abundant number, since it is smaller than the sum of its proper divisors (216376176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115001424 is a wasteful number, since it uses less digits than its factorization.
115001424 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1049 (or 1037 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 115001424 is about 10723.8716889004. The cubic root of 115001424 is about 486.2964202990.
Adding to 115001424 its reverse (424100511), we get a palindrome (539101935).
The spelling of 115001424 in words is "one hundred fifteen million, one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •