Base | Representation |
---|---|
bin | 10001011001111… |
… | …10111101100000 |
3 | 101011202002000000 |
4 | 20230332331200 |
5 | 244334304302 |
6 | 22253300000 |
7 | 3422030664 |
oct | 1054767540 |
9 | 334662000 |
10 | 146009952 |
11 | 75467490 |
12 | 40a94600 |
13 | 24332a2a |
14 | 1556a8a4 |
15 | cc4231c |
hex | 8b3ef60 |
146009952 has 168 divisors, whose sum is σ = 470995560. Its totient is φ = 44167680.
The previous prime is 146009947. The next prime is 146009959. The reversal of 146009952 is 259900641.
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 (146009959) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 256324 + ... + 256892.
It is an arithmetic number, because the mean of its divisors is an integer number (2803545).
Almost surely, 2146009952 is an apocalyptic number.
146009952 is a gapful number since it is divisible by the number (12) 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 146009952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235497780).
146009952 is an abundant number, since it is smaller than the sum of its proper divisors (324985608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146009952 is an equidigital number, since it uses as much as digits as its factorization.
146009952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608 (or 585 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 146009952 is about 12083.4577832672. The cubic root of 146009952 is about 526.5757068430.
The spelling of 146009952 in words is "one hundred forty-six million, nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •