Base | Representation |
---|---|
bin | 111000010100… |
… | …101111001000 |
3 | 1000210010202212 |
4 | 320110233020 |
5 | 12234440000 |
6 | 1244244252 |
7 | 236333435 |
oct | 70245710 |
9 | 30703685 |
10 | 14765000 |
11 | 8375188 |
12 | 4b40688 |
13 | 309c6b3 |
14 | 1d64b8c |
15 | 1469c35 |
hex | e14bc8 |
14765000 has 40 divisors (see below), whose sum is σ = 34606110. Its totient is φ = 5904000.
The previous prime is 14764999. The next prime is 14765017. The reversal of 14765000 is 56741.
It can be written as a sum of positive squares in 5 ways, for example, as 1119364 + 13645636 = 1058^2 + 3694^2 .
It is a tau number, because it is divible by the number of its divisors (40).
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 9 ways as a sum of consecutive naturals, for example, 3524 + ... + 6476.
Almost surely, 214765000 is an apocalyptic number.
14765000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14765000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17303055).
14765000 is an abundant number, since it is smaller than the sum of its proper divisors (19841110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14765000 is an equidigital number, since it uses as much as digits as its factorization.
14765000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2979 (or 2960 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 14765000 is about 3842.5252113682. The cubic root of 14765000 is about 245.3265117695.
The spelling of 14765000 in words is "fourteen million, seven hundred sixty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •