Base | Representation |
---|---|
bin | 10001010011100… |
… | …11001100100000 |
3 | 101010011200010000 |
4 | 20221303030200 |
5 | 244131102303 |
6 | 22223340000 |
7 | 3411653454 |
oct | 1051631440 |
9 | 333150100 |
10 | 145175328 |
11 | 74a47411 |
12 | 40751600 |
13 | 240ccb7c |
14 | 153d0664 |
15 | cb29da3 |
hex | 8a73320 |
145175328 has 60 divisors (see below), whose sum is σ = 426964230. Its totient is φ = 48390912.
The previous prime is 145175323. The next prime is 145175389. The reversal of 145175328 is 823571541.
It can be written as a sum of positive squares in only one way, i.e., 89643024 + 55532304 = 9468^2 + 7452^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 145175292 and 145175301.
It is not an unprimeable number, because it can be changed into a prime (145175323) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 25413 + ... + 30596.
Almost surely, 2145175328 is an apocalyptic number.
145175328 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
145175328 is an abundant number, since it is smaller than the sum of its proper divisors (281788902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145175328 is an equidigital number, since it uses as much as digits as its factorization.
145175328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56031 (or 56014 counting only the distinct ones).
The product of its digits is 33600, while the sum is 36.
The square root of 145175328 is about 12048.8724783691. The cubic root of 145175328 is about 525.5704493300.
The spelling of 145175328 in words is "one hundred forty-five million, one hundred seventy-five thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •