Base | Representation |
---|---|
bin | 11100001000110… |
… | …11011110001000 |
3 | 121110011011220202 |
4 | 32010123132020 |
5 | 440411321440 |
6 | 35231111332 |
7 | 5564216306 |
oct | 1604333610 |
9 | 543134822 |
10 | 236042120 |
11 | 11126aa36 |
12 | 67072548 |
13 | 39b964c2 |
14 | 234c5276 |
15 | 15ac8615 |
hex | e11b788 |
236042120 has 32 divisors (see below), whose sum is σ = 533093400. Its totient is φ = 94061568.
The previous prime is 236042119. The next prime is 236042167. The reversal of 236042120 is 21240632.
It can be written as a sum of positive squares in 4 ways, for example, as 88322404 + 147719716 = 9398^2 + 12154^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 236042092 and 236042101.
It is an unprimeable number.
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, 209 + ... + 21728.
Almost surely, 2236042120 is an apocalyptic number.
236042120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
236042120 is an abundant number, since it is smaller than the sum of its proper divisors (297051280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
236042120 is a wasteful number, since it uses less digits than its factorization.
236042120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22217 (or 22213 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 236042120 is about 15363.6623238081. The cubic root of 236042120 is about 618.0114226549.
Adding to 236042120 its reverse (21240632), we get a palindrome (257282752).
The spelling of 236042120 in words is "two hundred thirty-six million, forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •