Base | Representation |
---|---|
bin | 110101111111… |
… | …001101010010 |
3 | 222122000121210 |
4 | 311333031102 |
5 | 12110340110 |
6 | 1223200550 |
7 | 231203010 |
oct | 65771522 |
9 | 28560553 |
10 | 14152530 |
11 | 7a97007 |
12 | 48a6156 |
13 | 2c169a2 |
14 | 1c458b0 |
15 | 1398520 |
hex | d7f352 |
14152530 has 64 divisors (see below), whose sum is σ = 40872960. Its totient is φ = 3063744.
The previous prime is 14152529. The next prime is 14152543. The reversal of 14152530 is 3525141.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14152497 and 14152506.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2217 + ... + 5763.
It is an arithmetic number, because the mean of its divisors is an integer number (638640).
Almost surely, 214152530 is an apocalyptic number.
14152530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14152530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20436480).
14152530 is an abundant number, since it is smaller than the sum of its proper divisors (26720430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14152530 is a wasteful number, since it uses less digits than its factorization.
14152530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3583.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 14152530 is about 3761.9848484543. The cubic root of 14152530 is about 241.8863501140.
Adding to 14152530 its reverse (3525141), we get a palindrome (17677671).
The spelling of 14152530 in words is "fourteen million, one hundred fifty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •