Base | Representation |
---|---|
bin | 1000100000110110001… |
… | …1010010011101000100 |
3 | 111222111211220221001101 |
4 | 2020031203102131010 |
5 | 4344013044230000 |
6 | 151104510505444 |
7 | 13365236356234 |
oct | 2101543223504 |
9 | 458454827041 |
10 | 146256242500 |
11 | 57032921795 |
12 | 24418b05284 |
13 | 10a3aa77934 |
14 | 711649dcc4 |
15 | 3c100c2e6a |
hex | 220d8d2744 |
146256242500 has 60 divisors (see below), whose sum is σ = 319924553872. Its totient is φ = 58485780000.
The previous prime is 146256242491. The next prime is 146256242501. The reversal of 146256242500 is 5242652641.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 146256242500.
It is not an unprimeable number, because it can be changed into a prime (146256242501) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12461635 + ... + 12473365.
Almost surely, 2146256242500 is an apocalyptic number.
146256242500 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 146256242500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159962276936).
146256242500 is an abundant number, since it is smaller than the sum of its proper divisors (173668311372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146256242500 is a wasteful number, since it uses less digits than its factorization.
146256242500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16742 (or 16725 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 146256242500 in words is "one hundred forty-six billion, two hundred fifty-six million, two hundred forty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •