Base | Representation |
---|---|
bin | 10010001011001… |
… | …11011011000100 |
3 | 101121220010121010 |
4 | 21011213123010 |
5 | 303012422030 |
6 | 23043522220 |
7 | 3530643420 |
oct | 1105473304 |
9 | 347803533 |
10 | 152467140 |
11 | 79077901 |
12 | 43089370 |
13 | 25783b57 |
14 | 1636bb80 |
15 | d5ba6b0 |
hex | 91676c4 |
152467140 has 48 divisors (see below), whose sum is σ = 487896192. Its totient is φ = 34849536.
The previous prime is 152467127. The next prime is 152467141. The reversal of 152467140 is 41764251.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 152467098 and 152467107.
It is not an unprimeable number, because it can be changed into a prime (152467141) 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 15 ways as a sum of consecutive naturals, for example, 181089 + ... + 181928.
It is an arithmetic number, because the mean of its divisors is an integer number (10164504).
Almost surely, 2152467140 is an apocalyptic number.
152467140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
152467140 is an abundant number, since it is smaller than the sum of its proper divisors (335429052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152467140 is a wasteful number, since it uses less digits than its factorization.
152467140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363036 (or 363034 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 152467140 is about 12347.7585010398. The cubic root of 152467140 is about 534.2264886710.
The spelling of 152467140 in words is "one hundred fifty-two million, four hundred sixty-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •