Base | Representation |
---|---|
bin | 1000011101000010000… |
… | …1101100001101100000 |
3 | 111212212111102000202010 |
4 | 2013100201230031200 |
5 | 4334413444213121 |
6 | 150415134352520 |
7 | 13330665101160 |
oct | 2072041541540 |
9 | 455774360663 |
10 | 145232413536 |
11 | 56657a02951 |
12 | 2419205b740 |
13 | 10906916592 |
14 | 705a50c5a0 |
15 | 3ba0286376 |
hex | 21d086c360 |
145232413536 has 192 divisors, whose sum is σ = 439973227008. Its totient is φ = 41089794048.
The previous prime is 145232413517. The next prime is 145232413583. The reversal of 145232413536 is 635314232541.
It is a junction number, because it is equal to n+sod(n) for n = 145232413494 and 145232413503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29438526 + ... + 29443458.
It is an arithmetic number, because the mean of its divisors is an integer number (2291527224).
Almost surely, 2145232413536 is an apocalyptic number.
145232413536 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 145232413536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219986613504).
145232413536 is an abundant number, since it is smaller than the sum of its proper divisors (294740813472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145232413536 is a wasteful number, since it uses less digits than its factorization.
145232413536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5373 (or 5365 counting only the distinct ones).
The product of its digits is 259200, while the sum is 39.
The spelling of 145232413536 in words is "one hundred forty-five billion, two hundred thirty-two million, four hundred thirteen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •