Base | Representation |
---|---|
bin | 1000011100111010011… |
… | …1010001111110111100 |
3 | 111212210021000201220210 |
4 | 2013032213101332330 |
5 | 4334332240341130 |
6 | 150412030512420 |
7 | 13330125252225 |
oct | 2071647217674 |
9 | 455707021823 |
10 | 145200324540 |
11 | 56640885a17 |
12 | 24183365710 |
13 | 1090008c7cb |
14 | 705615824c |
15 | 3b9c5485b0 |
hex | 21ce9d1fbc |
145200324540 has 48 divisors (see below), whose sum is σ = 406596087072. Its totient is φ = 38716736256.
The previous prime is 145200324539. The next prime is 145200324551. The reversal of 145200324540 is 45423002541.
145200324540 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 145200324498 and 145200324507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 638062 + ... + 835178.
It is an arithmetic number, because the mean of its divisors is an integer number (8470751814).
Almost surely, 2145200324540 is an apocalyptic number.
145200324540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145200324540 is an abundant number, since it is smaller than the sum of its proper divisors (261395762532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145200324540 is a wasteful number, since it uses less digits than its factorization.
145200324540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209406 (or 209404 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The spelling of 145200324540 in words is "one hundred forty-five billion, two hundred million, three hundred twenty-four thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •