Base | Representation |
---|---|
bin | 10001011110100… |
… | …01010101011100 |
3 | 101012212112102111 |
4 | 20233101111130 |
5 | 300013001000 |
6 | 22314203404 |
7 | 3430105642 |
oct | 1057212534 |
9 | 335775374 |
10 | 146609500 |
11 | 75836984 |
12 | 41123564 |
13 | 244b28ab |
14 | 15685192 |
15 | cd0ecba |
hex | 8bd155c |
146609500 has 48 divisors (see below), whose sum is σ = 331269120. Its totient is φ = 56616000.
The previous prime is 146609483. The next prime is 146609537. The reversal of 146609500 is 5906641.
146609500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9445 + ... + 19555.
It is an arithmetic number, because the mean of its divisors is an integer number (6901440).
Almost surely, 2146609500 is an apocalyptic number.
146609500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146609500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165634560).
146609500 is an abundant number, since it is smaller than the sum of its proper divisors (184659620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146609500 is a wasteful number, since it uses less digits than its factorization.
146609500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10159 (or 10147 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The square root of 146609500 is about 12108.2409952891. The cubic root of 146609500 is about 527.2954666264.
The spelling of 146609500 in words is "one hundred forty-six million, six hundred nine thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •