Base | Representation |
---|---|
bin | 1110000101001… |
… | …00100000111010 |
3 | 22020020211110000 |
4 | 13002210200322 |
5 | 220214124422 |
6 | 15415333430 |
7 | 2632645512 |
oct | 702444072 |
9 | 266224400 |
10 | 118114362 |
11 | 60744083 |
12 | 33681276 |
13 | 1b616872 |
14 | 11988842 |
15 | a581cac |
hex | 70a483a |
118114362 has 40 divisors (see below), whose sum is σ = 267131700. Its totient is φ = 39004416.
The previous prime is 118114357. The next prime is 118114363. The reversal of 118114362 is 263411811.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 108805761 + 9308601 = 10431^2 + 3051^2 .
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 (118114363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 14314 + ... + 21002.
Almost surely, 2118114362 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 118114362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133565850).
118114362 is an abundant number, since it is smaller than the sum of its proper divisors (149017338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
118114362 is a wasteful number, since it uses less digits than its factorization.
118114362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6812 (or 6803 counting only the distinct ones).
The product of its digits is 1152, while the sum is 27.
The square root of 118114362 is about 10868.0431541285. The cubic root of 118114362 is about 490.6452169418.
The spelling of 118114362 in words is "one hundred eighteen million, one hundred fourteen thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •