Base | Representation |
---|---|
bin | 1000011100010000111… |
… | …0011001101000101000 |
3 | 111212100010001122220220 |
4 | 2013010032121220220 |
5 | 4334003130430440 |
6 | 150342443050040 |
7 | 13322610626226 |
oct | 2070416315050 |
9 | 455303048826 |
10 | 145026030120 |
11 | 5656145aa44 |
12 | 24134b10920 |
13 | 108a2c3590a |
14 | 703ad47b16 |
15 | 3b8c0ba8d0 |
hex | 21c4399a28 |
145026030120 has 32 divisors (see below), whose sum is σ = 435078090720. Its totient is φ = 38673608000.
The previous prime is 145026030103. The next prime is 145026030181. The reversal of 145026030120 is 21030620541.
145026030120 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 (24).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 604275006 + ... + 604275245.
It is an arithmetic number, because the mean of its divisors is an integer number (13596190335).
Almost surely, 2145026030120 is an apocalyptic number.
145026030120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145026030120 is an abundant number, since it is smaller than the sum of its proper divisors (290052060600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145026030120 is a wasteful number, since it uses less digits than its factorization.
145026030120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1208550265 (or 1208550261 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 145026030120 its reverse (21030620541), we get a palindrome (166056650661).
The spelling of 145026030120 in words is "one hundred forty-five billion, twenty-six million, thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •