Base | Representation |
---|---|
bin | 1101101101110… |
… | …11111010010001 |
3 | 22000111212202212 |
4 | 12312323322101 |
5 | 213424030330 |
6 | 15230121505 |
7 | 2565013625 |
oct | 666737221 |
9 | 260455685 |
10 | 115064465 |
11 | 59a506aa |
12 | 32650295 |
13 | 1aab95a9 |
14 | 113d3185 |
15 | a17d295 |
hex | 6dbbe91 |
115064465 has 8 divisors (see below), whose sum is σ = 138265728. Its totient is φ = 91926000.
The previous prime is 115064459. The next prime is 115064473. The reversal of 115064465 is 564460511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115064465 - 26 = 115064401 is a prime.
It is a super-2 number, since 2×1150644652 = 26479662211472450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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, 11567 + ... + 19076.
It is an arithmetic number, because the mean of its divisors is an integer number (17283216).
Almost surely, 2115064465 is an apocalyptic number.
It is an amenable number.
115064465 is a deficient number, since it is larger than the sum of its proper divisors (23201263).
115064465 is an equidigital number, since it uses as much as digits as its factorization.
115064465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31399.
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 115064465 is about 10726.8105697826. The cubic root of 115064465 is about 486.3852627136.
The spelling of 115064465 in words is "one hundred fifteen million, sixty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •