Base | Representation |
---|---|
bin | 10001010100001… |
… | …10111011000000 |
3 | 101010022202221121 |
4 | 20222012323000 |
5 | 244141144003 |
6 | 22225202024 |
7 | 3412441153 |
oct | 1052067300 |
9 | 333282847 |
10 | 145256128 |
11 | 74aa2096 |
12 | 40790314 |
13 | 2412a894 |
14 | 15411c9a |
15 | cb43cbd |
hex | 8a86ec0 |
145256128 has 56 divisors (see below), whose sum is σ = 303306480. Its totient is φ = 68920320.
The previous prime is 145256113. The next prime is 145256141. The reversal of 145256128 is 821652541.
It is a happy number.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 145256093 and 145256102.
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 7 ways as a sum of consecutive naturals, for example, 112575 + ... + 113857.
Almost surely, 2145256128 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 145256128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151653240).
145256128 is an abundant number, since it is smaller than the sum of its proper divisors (158050352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145256128 is a wasteful number, since it uses less digits than its factorization.
145256128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1385 (or 1375 counting only the distinct ones).
The product of its digits is 19200, while the sum is 34.
The square root of 145256128 is about 12052.2250227914. The cubic root of 145256128 is about 525.6679365475.
The spelling of 145256128 in words is "one hundred forty-five million, two hundred fifty-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •