Base | Representation |
---|---|
bin | 10001100000000… |
… | …10001010010000 |
3 | 101020020200202110 |
4 | 20300002022100 |
5 | 300040400423 |
6 | 22322345320 |
7 | 3431601000 |
oct | 1060021220 |
9 | 336220673 |
10 | 146809488 |
11 | 75963161 |
12 | 411bb240 |
13 | 24552927 |
14 | 156d8000 |
15 | cd4e193 |
hex | 8c02290 |
146809488 has 160 divisors (see below), whose sum is σ = 456121600. Its totient is φ = 40642560.
The previous prime is 146809477. The next prime is 146809489. The reversal of 146809488 is 884908641.
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 (146809489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 609048 + ... + 609288.
It is an arithmetic number, because the mean of its divisors is an integer number (2850760).
Almost surely, 2146809488 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146809488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228060800).
146809488 is an abundant number, since it is smaller than the sum of its proper divisors (309312112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146809488 is a wasteful number, since it uses less digits than its factorization.
146809488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310 (or 290 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 48.
The square root of 146809488 is about 12116.4965233354. The cubic root of 146809488 is about 527.5351165200.
The spelling of 146809488 in words is "one hundred forty-six million, eight hundred nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •