Base | Representation |
---|---|
bin | 1000011100100101101… |
… | …1010100001000010000 |
3 | 111212120012021111202222 |
4 | 2013021123110020100 |
5 | 4334143001122040 |
6 | 150355241400212 |
7 | 13325020465625 |
oct | 2071133241020 |
9 | 455505244688 |
10 | 145113301520 |
11 | 565a6748270 |
12 | 2415a199068 |
13 | 108b80408b5 |
14 | 704878434c |
15 | 3b94aa8bb5 |
hex | 21c96d4210 |
145113301520 has 160 divisors (see below), whose sum is σ = 390828913920. Its totient is φ = 49521950720.
The previous prime is 145113301511. The next prime is 145113301559. The reversal of 145113301520 is 25103311541.
It is a self number, because there is not a number n which added to its sum of digits gives 145113301520.
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, 5267141 + ... + 5294619.
It is an arithmetic number, because the mean of its divisors is an integer number (2442680712).
Almost surely, 2145113301520 is an apocalyptic number.
145113301520 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 145113301520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195414456960).
145113301520 is an abundant number, since it is smaller than the sum of its proper divisors (245715612400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145113301520 is a wasteful number, since it uses less digits than its factorization.
145113301520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27873 (or 27867 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 145113301520 in words is "one hundred forty-five billion, one hundred thirteen million, three hundred one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •