Base | Representation |
---|---|
bin | 110111001110… |
… | …001010011010 |
3 | 1000020110020120 |
4 | 313032022122 |
5 | 12201212210 |
6 | 1234134110 |
7 | 234020610 |
oct | 67161232 |
9 | 30213216 |
10 | 14475930 |
11 | 8197a87 |
12 | 4a21336 |
13 | 2ccac51 |
14 | 1ccb6b0 |
15 | 140e270 |
hex | dce29a |
14475930 has 64 divisors (see below), whose sum is σ = 41091840. Its totient is φ = 3193344.
The previous prime is 14475919. The next prime is 14475931. The reversal of 14475930 is 3957441.
It is a junction number, because it is equal to n+sod(n) for n = 14475891 and 14475900.
It is not an unprimeable number, because it can be changed into a prime (14475931) 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 31 ways as a sum of consecutive naturals, for example, 4902 + ... + 7278.
It is an arithmetic number, because the mean of its divisors is an integer number (642060).
Almost surely, 214475930 is an apocalyptic number.
14475930 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 14475930, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20545920).
14475930 is an abundant number, since it is smaller than the sum of its proper divisors (26615910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14475930 is a wasteful number, since it uses less digits than its factorization.
14475930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2423.
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 14475930 is about 3804.7246943767. The cubic root of 14475930 is about 243.7149430187.
The spelling of 14475930 in words is "fourteen million, four hundred seventy-five thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •