Base | Representation |
---|---|
bin | 10001100000000… |
… | …10100011000000 |
3 | 101020020202221010 |
4 | 20300002203000 |
5 | 300040423242 |
6 | 22322400520 |
7 | 3431605422 |
oct | 1060024300 |
9 | 336222833 |
10 | 146811072 |
11 | 75964371 |
12 | 41200140 |
13 | 24553575 |
14 | 156d8812 |
15 | cd4e89c |
hex | 8c028c0 |
146811072 has 56 divisors (see below), whose sum is σ = 393395200. Its totient is φ = 48312576.
The previous prime is 146811059. The next prime is 146811089. The reversal of 146811072 is 270118641.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10329 + ... + 20007.
Almost surely, 2146811072 is an apocalyptic number.
146811072 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 146811072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196697600).
146811072 is an abundant number, since it is smaller than the sum of its proper divisors (246584128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146811072 is an equidigital number, since it uses as much as digits as its factorization.
146811072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9773 (or 9763 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 30.
The square root of 146811072 is about 12116.5618885887. The cubic root of 146811072 is about 527.5370137920.
It can be divided in two parts, 14681 and 1072, that added together give a triangular number (15753 = T177).
The spelling of 146811072 in words is "one hundred forty-six million, eight hundred eleven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •