Base | Representation |
---|---|
bin | 1000100001101110110… |
… | …1101100000000000000 |
3 | 112000010102000121201100 |
4 | 2020123231230000000 |
5 | 4400004411141400 |
6 | 151144235334400 |
7 | 13404153114300 |
oct | 2103355540000 |
9 | 460112017640 |
10 | 146493849600 |
11 | 57144a6049a |
12 | 244845b1400 |
13 | 10a7806b557 |
14 | 7139c71600 |
15 | 3c25daa100 |
hex | 221bb6c000 |
146493849600 has 810 divisors, whose sum is σ = 611184894684. Its totient is φ = 33443020800.
The previous prime is 146493849583. The next prime is 146493849613. The reversal of 146493849600 is 6948394641.
It is a happy number.
146493849600 is a `hidden beast` number, since 1 + 4 + 64 + 93 + 8 + 496 + 0 + 0 = 666.
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 53 ways as a sum of consecutive naturals, for example, 180633195 + ... + 180634005.
Almost surely, 2146493849600 is an apocalyptic number.
146493849600 is a gapful number since it is divisible by the number (10) 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 146493849600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305592447342).
146493849600 is an abundant number, since it is smaller than the sum of its proper divisors (464691045084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146493849600 is an equidigital number, since it uses as much as digits as its factorization.
146493849600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869 (or 828 counting only the distinct ones).
The product of its (nonzero) digits is 4478976, while the sum is 54.
The spelling of 146493849600 in words is "one hundred forty-six billion, four hundred ninety-three million, eight hundred forty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •