Base | Representation |
---|---|
bin | 1000100001110000010… |
… | …0111111000000000000 |
3 | 112000010211111220010120 |
4 | 2020130010333000000 |
5 | 4400012442103421 |
6 | 151145014300240 |
7 | 13404256041330 |
oct | 2103404770000 |
9 | 460124456116 |
10 | 146499956736 |
11 | 57148451911 |
12 | 24486657680 |
13 | 10a793c9243 |
14 | 713a9c10c0 |
15 | 3c266b48c6 |
hex | 221c13f000 |
146499956736 has 208 divisors, whose sum is σ = 460830640128. Its totient is φ = 40506163200.
The previous prime is 146499956723. The next prime is 146499956737. The reversal of 146499956736 is 637659994641.
It is a super-3 number, since 3×1464999567363 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146499956737) 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, 2639026 + ... + 2693966.
Almost surely, 2146499956736 is an apocalyptic number.
146499956736 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 146499956736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (230415320064).
146499956736 is an abundant number, since it is smaller than the sum of its proper divisors (314330683392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146499956736 is an equidigital number, since it uses as much as digits as its factorization.
146499956736 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55006 (or 54984 counting only the distinct ones).
The product of its digits is 264539520, while the sum is 69.
The spelling of 146499956736 in words is "one hundred forty-six billion, four hundred ninety-nine million, nine hundred fifty-six thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •