Base | Representation |
---|---|
bin | 10001100101011… |
… | …00100000011100 |
3 | 101021120010212200 |
4 | 20302230200130 |
5 | 300230212403 |
6 | 22345331500 |
7 | 3440535141 |
oct | 1062544034 |
9 | 337503780 |
10 | 147507228 |
11 | 7629a400 |
12 | 41496b90 |
13 | 247383ab |
14 | 1583a3c8 |
15 | ce3aca3 |
hex | 8cac81c |
147507228 has 54 divisors (see below), whose sum is σ = 409855992. Its totient is φ = 44697840.
The previous prime is 147507223. The next prime is 147507229. The reversal of 147507228 is 822705741.
147507228 is a `hidden beast` number, since 147 + 507 + 2 + 2 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 147507192 and 147507201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147507223) 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 17 ways as a sum of consecutive naturals, for example, 12576 + ... + 21287.
Almost surely, 2147507228 is an apocalyptic number.
147507228 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
147507228 is an abundant number, since it is smaller than the sum of its proper divisors (262348764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147507228 is a wasteful number, since it uses less digits than its factorization.
147507228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33895 (or 33879 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 36.
The square root of 147507228 is about 12145.2553698965. The cubic root of 147507228 is about 528.3695329802.
The spelling of 147507228 in words is "one hundred forty-seven million, five hundred seven thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •