Base | Representation |
---|---|
bin | 1101101101110… |
… | …00011111110000 |
3 | 22000111011120220 |
4 | 12312320133300 |
5 | 213423103410 |
6 | 15225533040 |
7 | 2564625066 |
oct | 666703760 |
9 | 260434526 |
10 | 115050480 |
11 | 59a41146 |
12 | 32644180 |
13 | 1aab310c |
14 | 113cc036 |
15 | a179070 |
hex | 6db87f0 |
115050480 has 40 divisors (see below), whose sum is σ = 356657232. Its totient is φ = 30680064.
The previous prime is 115050449. The next prime is 115050487. The reversal of 115050480 is 84050511.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1150504802 = 26473225896460800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 115050480.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115050487) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 239449 + ... + 239928.
Almost surely, 2115050480 is an apocalyptic number.
115050480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115050480 is an abundant number, since it is smaller than the sum of its proper divisors (241606752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115050480 is a wasteful number, since it uses less digits than its factorization.
115050480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 479393 (or 479387 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
The square root of 115050480 is about 10726.1586786696. The cubic root of 115050480 is about 486.3655567355.
The spelling of 115050480 in words is "one hundred fifteen million, fifty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •