Base | Representation |
---|---|
bin | 1000011110010000110… |
… | …1000010100110000000 |
3 | 111220201111121102022022 |
4 | 2013210031002212000 |
5 | 4341103002411022 |
6 | 150512010301012 |
7 | 13342114133150 |
oct | 2074415024600 |
9 | 456644542268 |
10 | 145562544512 |
11 | 56807297170 |
12 | 24264727768 |
13 | 1095a133b58 |
14 | 708c2c6760 |
15 | 3bbe247c42 |
hex | 21e4342980 |
145562544512 has 512 divisors, whose sum is σ = 388327219200. Its totient is φ = 52715520000.
The previous prime is 145562544473. The next prime is 145562544539. The reversal of 145562544512 is 215445265541.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1441213262 + ... + 1441213362.
It is an arithmetic number, because the mean of its divisors is an integer number (758451600).
Almost surely, 2145562544512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145562544512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194163609600).
145562544512 is an abundant number, since it is smaller than the sum of its proper divisors (242764674688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145562544512 is a wasteful number, since it uses less digits than its factorization.
145562544512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306 (or 294 counting only the distinct ones).
The product of its digits is 960000, while the sum is 44.
The spelling of 145562544512 in words is "one hundred forty-five billion, five hundred sixty-two million, five hundred forty-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.218 sec. • engine limits •