Base | Representation |
---|---|
bin | 1101110000111… |
… | …10111010010010 |
3 | 22001021111000120 |
4 | 12320132322102 |
5 | 214030014340 |
6 | 15242531110 |
7 | 2601323100 |
oct | 670367222 |
9 | 261244016 |
10 | 115469970 |
11 | 5a1a8330 |
12 | 32806a96 |
13 | 1abcc035 |
14 | 1149ac70 |
15 | a20d4d0 |
hex | 6e1ee92 |
115469970 has 192 divisors, whose sum is σ = 363056256. Its totient is φ = 23224320.
The previous prime is 115469969. The next prime is 115469993. The reversal of 115469970 is 79964511.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 598194 + ... + 598386.
It is an arithmetic number, because the mean of its divisors is an integer number (1890918).
Almost surely, 2115469970 is an apocalyptic number.
115469970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 115469970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181528128).
115469970 is an abundant number, since it is smaller than the sum of its proper divisors (247586286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115469970 is a wasteful number, since it uses less digits than its factorization.
115469970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265 (or 258 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 42.
The square root of 115469970 is about 10745.6954172357. The cubic root of 115469970 is about 486.9559585025.
The spelling of 115469970 in words is "one hundred fifteen million, four hundred sixty-nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •