Base | Representation |
---|---|
bin | 10001010011001… |
… | …11001011000000 |
3 | 101010002011120000 |
4 | 20221213023000 |
5 | 244123013310 |
6 | 22222320000 |
7 | 3411360051 |
oct | 1051471300 |
9 | 333064500 |
10 | 145126080 |
11 | 74a13410 |
12 | 40729000 |
13 | 240b3628 |
14 | 153ba728 |
15 | cb1a4c0 |
hex | 8a672c0 |
145126080 has 280 divisors, whose sum is σ = 564276240. Its totient is φ = 35112960.
The previous prime is 145126061. The next prime is 145126139. The reversal of 145126080 is 80621541.
145126080 is a `hidden beast` number, since 1 + 4 + 51 + 2 + 608 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 284866 + ... + 285374.
Almost surely, 2145126080 is an apocalyptic number.
145126080 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 145126080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (282138120).
145126080 is an abundant number, since it is smaller than the sum of its proper divisors (419150160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145126080 is a wasteful number, since it uses less digits than its factorization.
145126080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549 (or 530 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 145126080 is about 12046.8286283154. The cubic root of 145126080 is about 525.5110126448.
The spelling of 145126080 in words is "one hundred forty-five million, one hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •