Base | Representation |
---|---|
bin | 1101101101011… |
… | …00011010100000 |
3 | 22000101122201000 |
4 | 12312230122200 |
5 | 213420012432 |
6 | 15224512000 |
7 | 2564330601 |
oct | 666543240 |
9 | 260348630 |
10 | 115000992 |
11 | 59a07a47 |
12 | 3261b600 |
13 | 1aa96732 |
14 | 113b7da8 |
15 | a16957c |
hex | 6dac6a0 |
115000992 has 48 divisors (see below), whose sum is σ = 335422080. Its totient is φ = 38333376.
The previous prime is 115000987. The next prime is 115000993. The reversal of 115000992 is 299000511.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (115000993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65688 + ... + 67415.
It is an arithmetic number, because the mean of its divisors is an integer number (6987960).
Almost surely, 2115000992 is an apocalyptic number.
115000992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115000992 is an abundant number, since it is smaller than the sum of its proper divisors (220421088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115000992 is a wasteful number, since it uses less digits than its factorization.
115000992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133122 (or 133108 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 27.
The square root of 115000992 is about 10723.8515469024. The cubic root of 115000992 is about 486.2958113780.
The spelling of 115000992 in words is "one hundred fifteen million, nine hundred ninety-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •