Base | Representation |
---|---|
bin | 10001010111000… |
… | …00110111010010 |
3 | 101011000111022010 |
4 | 20223200313102 |
5 | 244234441110 |
6 | 22241123350 |
7 | 3415534212 |
oct | 1053406722 |
9 | 334014263 |
10 | 145624530 |
11 | 75223957 |
12 | 40929556 |
13 | 2422947c |
14 | 154aa242 |
15 | cbb8020 |
hex | 8ae0dd2 |
145624530 has 16 divisors (see below), whose sum is σ = 349498944. Its totient is φ = 38833200.
The previous prime is 145624519. The next prime is 145624537. The reversal of 145624530 is 35426541.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 4854151 = 145624530 / (1 + 4 + 5 + 6 + 2 + 4 + 5 + 3 + 0).
It is not an unprimeable number, because it can be changed into a prime (145624537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2427046 + ... + 2427105.
It is an arithmetic number, because the mean of its divisors is an integer number (21843684).
Almost surely, 2145624530 is an apocalyptic number.
145624530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145624530 is an abundant number, since it is smaller than the sum of its proper divisors (203874414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145624530 is a wasteful number, since it uses less digits than its factorization.
145624530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4854161.
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 145624530 is about 12067.4989123679. The cubic root of 145624530 is about 526.1119651584. Note that the first 3 decimals are identical.
The spelling of 145624530 in words is "one hundred forty-five million, six hundred twenty-four thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •