Base | Representation |
---|---|
bin | 10001100001001… |
… | …10111111010000 |
3 | 101020112100200102 |
4 | 20300212333100 |
5 | 300110212321 |
6 | 22325511532 |
7 | 3433066535 |
oct | 1060467720 |
9 | 336470612 |
10 | 146960336 |
11 | 75a56526 |
12 | 412725a8 |
13 | 245a64a3 |
14 | 15736d8c |
15 | cd7dc0b |
hex | 8c26fd0 |
146960336 has 40 divisors (see below), whose sum is σ = 296361984. Its totient is φ = 70519680.
The previous prime is 146960329. The next prime is 146960347. The reversal of 146960336 is 633069641.
It is a self number, because there is not a number n which added to its sum of digits gives 146960336.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61826 + ... + 64158.
Almost surely, 2146960336 is an apocalyptic number.
146960336 is a gapful number since it is divisible by the number (16) 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 146960336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148180992).
146960336 is an abundant number, since it is smaller than the sum of its proper divisors (149401648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146960336 is a wasteful number, since it uses less digits than its factorization.
146960336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2499 (or 2493 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 38.
The square root of 146960336 is about 12122.7198268375. The cubic root of 146960336 is about 527.7157369470.
The spelling of 146960336 in words is "one hundred forty-six million, nine hundred sixty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •