Base | Representation |
---|---|
bin | 10001010100100… |
… | …01101100000110 |
3 | 101010102000110000 |
4 | 20222101230012 |
5 | 244144101410 |
6 | 22230142130 |
7 | 3413013555 |
oct | 1052215406 |
9 | 333360400 |
10 | 145300230 |
11 | 75022239 |
12 | 407b1946 |
13 | 2414498a |
14 | 15423d9c |
15 | cb51dc0 |
hex | 8a91b06 |
145300230 has 40 divisors (see below), whose sum is σ = 390698352. Its totient is φ = 38746512.
The previous prime is 145300123. The next prime is 145300247. The reversal of 145300230 is 32003541.
It is a super-2 number, since 2×1453002302 = 42224313676105800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 19 ways as a sum of consecutive naturals, for example, 88882 + ... + 90501.
Almost surely, 2145300230 is an apocalyptic number.
145300230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145300230 is an abundant number, since it is smaller than the sum of its proper divisors (245398122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145300230 is a wasteful number, since it uses less digits than its factorization.
145300230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179402 (or 179393 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 145300230 is about 12054.0545046055. The cubic root of 145300230 is about 525.7211314610.
Adding to 145300230 its reverse (32003541), we get a palindrome (177303771).
It can be divided in two parts, 145300 and 230, that added together give a triangular number (145530 = T539).
The spelling of 145300230 in words is "one hundred forty-five million, three hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •