Base | Representation |
---|---|
bin | 110111100010… |
… | …111100101110 |
3 | 1000101210000220 |
4 | 313202330232 |
5 | 12211423240 |
6 | 1240032210 |
7 | 234524046 |
oct | 67427456 |
9 | 30353026 |
10 | 14561070 |
11 | 8245a47 |
12 | 4a62666 |
13 | 302a924 |
14 | 1d10726 |
15 | 14295d0 |
hex | de2f2e |
14561070 has 64 divisors (see below), whose sum is σ = 37324800. Its totient is φ = 3627008.
The previous prime is 14561039. The next prime is 14561077. The reversal of 14561070 is 7016541.
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 14561070.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14561077) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32206 + ... + 32654.
It is an arithmetic number, because the mean of its divisors is an integer number (583200).
Almost surely, 214561070 is an apocalyptic number.
14561070 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 14561070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18662400).
14561070 is an abundant number, since it is smaller than the sum of its proper divisors (22763730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14561070 is a wasteful number, since it uses less digits than its factorization.
14561070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529.
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 14561070 is about 3815.8970111889. The cubic root of 14561070 is about 244.1918114612.
The spelling of 14561070 in words is "fourteen million, five hundred sixty-one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •