Base | Representation |
---|---|
bin | 10001100000011… |
… | …00001011111000 |
3 | 101020022210002100 |
4 | 20300030023320 |
5 | 300043204202 |
6 | 22323303400 |
7 | 3432131502 |
oct | 1060141370 |
9 | 336283070 |
10 | 146850552 |
11 | 75990aa2 |
12 | 4121ab60 |
13 | 24568524 |
14 | 15708d72 |
15 | cd5b41c |
hex | 8c0c2f8 |
146850552 has 48 divisors (see below), whose sum is σ = 398679840. Its totient is φ = 48832128.
The previous prime is 146850527. The next prime is 146850553. The reversal of 146850552 is 255058641.
146850552 is a `hidden beast` number, since 146 + 8 + 505 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146850553) 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 11 ways as a sum of consecutive naturals, for example, 30673 + ... + 35135.
It is an arithmetic number, because the mean of its divisors is an integer number (8305830).
Almost surely, 2146850552 is an apocalyptic number.
146850552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146850552 is an abundant number, since it is smaller than the sum of its proper divisors (251829288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146850552 is a wasteful number, since it uses less digits than its factorization.
146850552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4932 (or 4925 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
The square root of 146850552 is about 12118.1909540987. The cubic root of 146850552 is about 527.5842974525.
The spelling of 146850552 in words is "one hundred forty-six million, eight hundred fifty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •