Base | Representation |
---|---|
bin | 1000011100100010100… |
… | …0111101101100000000 |
3 | 111212112021102220222200 |
4 | 2013020220331230000 |
5 | 4334131111234100 |
6 | 150354050433200 |
7 | 13324500343341 |
oct | 2071050755400 |
9 | 455467386880 |
10 | 145100102400 |
11 | 5659a252600 |
12 | 24155892800 |
13 | 108b539bb76 |
14 | 7046b0a0c8 |
15 | 3b9384ce00 |
hex | 21c8a3db00 |
145100102400 has 972 divisors, whose sum is σ = 578457559680. Its totient is φ = 34670592000.
The previous prime is 145100102359. The next prime is 145100102419. The reversal of 145100102400 is 4201001541.
145100102400 is a `hidden beast` number, since 14 + 510 + 0 + 102 + 40 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 759686305 + ... + 759686495.
Almost surely, 2145100102400 is an apocalyptic number.
145100102400 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 145100102400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (289228779840).
145100102400 is an abundant number, since it is smaller than the sum of its proper divisors (433357457280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145100102400 is a wasteful number, since it uses less digits than its factorization.
145100102400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354 (or 321 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 145100102400 its reverse (4201001541), we get a palindrome (149301103941).
The spelling of 145100102400 in words is "one hundred forty-five billion, one hundred million, one hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •