Base | Representation |
---|---|
bin | 1000011100100100001… |
… | …1011000111111110000 |
3 | 111212112202110212212110 |
4 | 2013021003120333300 |
5 | 4334134344430000 |
6 | 150354455125320 |
7 | 13324613255412 |
oct | 2071103307760 |
9 | 455482425773 |
10 | 145107030000 |
11 | 565a3154399 |
12 | 24158073840 |
13 | 108b695613a |
14 | 70479d09b2 |
15 | 3b9426a850 |
hex | 21c90d8ff0 |
145107030000 has 200 divisors, whose sum is σ = 468865577488. Its totient is φ = 38658816000.
The previous prime is 145107029971. The next prime is 145107030001. The reversal of 145107030000 is 30701541.
It is a tau number, because it is divible by the number of its divisors (200).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145107030001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 50788572 + ... + 50791428.
Almost surely, 2145107030000 is an apocalyptic number.
145107030000 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 145107030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234432788744).
145107030000 is an abundant number, since it is smaller than the sum of its proper divisors (323758547488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145107030000 is a wasteful number, since it uses less digits than its factorization.
145107030000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4581 (or 4560 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 21.
Adding to 145107030000 its reverse (30701541), we get a palindrome (145137731541).
The spelling of 145107030000 in words is "one hundred forty-five billion, one hundred seven million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •