Base | Representation |
---|---|
bin | 10001011110010… |
… | …01011000100000 |
3 | 101012210212202010 |
4 | 20233021120200 |
5 | 300010430203 |
6 | 22313352520 |
7 | 3426611661 |
oct | 1057113040 |
9 | 335725663 |
10 | 146576928 |
11 | 75814463 |
12 | 41108740 |
13 | 244a0b14 |
14 | 15677368 |
15 | cd05303 |
hex | 8bc9620 |
146576928 has 48 divisors (see below), whose sum is σ = 397184256. Its totient is φ = 47281920.
The previous prime is 146576891. The next prime is 146576929. The reversal of 146576928 is 829675641.
146576928 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (146576929) 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 7 ways as a sum of consecutive naturals, for example, 21651 + ... + 27602.
It is an arithmetic number, because the mean of its divisors is an integer number (8274672).
Almost surely, 2146576928 is an apocalyptic number.
It is an amenable number.
146576928 is an abundant number, since it is smaller than the sum of its proper divisors (250607328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146576928 is a wasteful number, since it uses less digits than its factorization.
146576928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49297 (or 49289 counting only the distinct ones).
The product of its digits is 725760, while the sum is 48.
The square root of 146576928 is about 12106.8958862295. The cubic root of 146576928 is about 527.2564142685.
The spelling of 146576928 in words is "one hundred forty-six million, five hundred seventy-six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •