Base | Representation |
---|---|
bin | 1110000100101… |
… | …01010010111001 |
3 | 22020010122221020 |
4 | 13002111102321 |
5 | 220210131100 |
6 | 15414133053 |
7 | 2632266000 |
oct | 702252271 |
9 | 266118836 |
10 | 118052025 |
11 | 60701263 |
12 | 33651189 |
13 | 1b5c4390 |
14 | 1196dc37 |
15 | a56d5a0 |
hex | 70954b9 |
118052025 has 96 divisors (see below), whose sum is σ = 245817600. Its totient is φ = 49674240.
The previous prime is 118052017. The next prime is 118052027. The reversal of 118052025 is 520250811.
118052025 = 15122 + 15132 + ... + 15612.
It is not a de Polignac number, because 118052025 - 23 = 118052017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 118051986 and 118052004.
It is not an unprimeable number, because it can be changed into a prime (118052027) 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 95 ways as a sum of consecutive naturals, for example, 334249 + ... + 334601.
It is an arithmetic number, because the mean of its divisors is an integer number (2560600).
Almost surely, 2118052025 is an apocalyptic number.
118052025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
118052025 is an abundant number, since it is smaller than the sum of its proper divisors (127765575).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
118052025 is a wasteful number, since it uses less digits than its factorization.
118052025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400 (or 381 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
The square root of 118052025 is about 10865.1748720396. The cubic root of 118052025 is about 490.5588861107.
The spelling of 118052025 in words is "one hundred eighteen million, fifty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •