Base | Representation |
---|---|
bin | 1101101101101… |
… | …11110110010100 |
3 | 22000111000221200 |
4 | 12312313312110 |
5 | 213423012303 |
6 | 15225512500 |
7 | 2564614260 |
oct | 666676624 |
9 | 260430850 |
10 | 115047828 |
11 | 59a3a155 |
12 | 32642730 |
13 | 1aab1b4c |
14 | 113cb0a0 |
15 | a1783a3 |
hex | 6db7d94 |
115047828 has 36 divisors (see below), whose sum is σ = 332361120. Its totient is φ = 32870736.
The previous prime is 115047827. The next prime is 115047839. The reversal of 115047828 is 828740511.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 115047792 and 115047801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115047827) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 228018 + ... + 228521.
Almost surely, 2115047828 is an apocalyptic number.
115047828 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
115047828 is an abundant number, since it is smaller than the sum of its proper divisors (217313292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115047828 is a wasteful number, since it uses less digits than its factorization.
115047828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456556 (or 456551 counting only the distinct ones).
The product of its (nonzero) digits is 17920, while the sum is 36.
The square root of 115047828 is about 10726.0350549492. The cubic root of 115047828 is about 486.3618196763.
The spelling of 115047828 in words is "one hundred fifteen million, forty-seven thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •