Base | Representation |
---|---|
bin | 10001011100000… |
… | …10101010000000 |
3 | 101012021011100122 |
4 | 20232002222000 |
5 | 244422142412 |
6 | 22303235412 |
7 | 3424264250 |
oct | 1056025200 |
9 | 335234318 |
10 | 146287232 |
11 | 75636843 |
12 | 40ba8b68 |
13 | 243cbcc0 |
14 | 155dd960 |
15 | cc99572 |
hex | 8b82a80 |
146287232 has 128 divisors (see below), whose sum is σ = 378134400. Its totient is φ = 54743040.
The previous prime is 146287217. The next prime is 146287237. The reversal of 146287232 is 232782641.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 146287192 and 146287201.
It is not an unprimeable number, because it can be changed into a prime (146287237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220982 + ... + 221642.
It is an arithmetic number, because the mean of its divisors is an integer number (2954175).
Almost surely, 2146287232 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 146287232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189067200).
146287232 is an abundant number, since it is smaller than the sum of its proper divisors (231847168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146287232 is a wasteful number, since it uses less digits than its factorization.
146287232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714 (or 702 counting only the distinct ones).
The product of its digits is 32256, while the sum is 35.
The square root of 146287232 is about 12094.9258782351. The cubic root of 146287232 is about 526.9088270204.
The spelling of 146287232 in words is "one hundred forty-six million, two hundred eighty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •