Base | Representation |
---|---|
bin | 10001010100101… |
… | …01010100111010 |
3 | 101010102202212212 |
4 | 20222111110322 |
5 | 244200041010 |
6 | 22230335122 |
7 | 3413105162 |
oct | 1052252472 |
9 | 333382785 |
10 | 145315130 |
11 | 75032454 |
12 | 407ba4a2 |
13 | 2414b6ac |
14 | 154295a2 |
15 | cb56505 |
hex | 8a9553a |
145315130 has 8 divisors (see below), whose sum is σ = 261567252. Its totient is φ = 58126048.
The previous prime is 145315087. The next prime is 145315141. The reversal of 145315130 is 31513541.
It can be written as a sum of positive squares in 2 ways, for example, as 131079601 + 14235529 = 11449^2 + 3773^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1453151302 = 42232974013833800, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145315096 and 145315105.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 7265747 + ... + 7265766.
Almost surely, 2145315130 is an apocalyptic number.
145315130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145315130 is a deficient number, since it is larger than the sum of its proper divisors (116252122).
145315130 is a wasteful number, since it uses less digits than its factorization.
145315130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14531520.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 145315130 is about 12054.6725380659. The cubic root of 145315130 is about 525.7391010979.
Adding to 145315130 its reverse (31513541), we get a palindrome (176828671).
The spelling of 145315130 in words is "one hundred forty-five million, three hundred fifteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •