Base | Representation |
---|---|
bin | 110110110101… |
… | …110000010000 |
3 | 1000001101002200 |
4 | 312311300100 |
5 | 12140012302 |
6 | 1232043200 |
7 | 233123253 |
oct | 66656020 |
9 | 30041080 |
10 | 14375952 |
11 | 8129958 |
12 | 4993500 |
13 | 2c945a6 |
14 | 1ca309a |
15 | 13de81c |
hex | db5c10 |
14375952 has 30 divisors (see below), whose sum is σ = 40233102. Its totient is φ = 4791936.
The previous prime is 14375947. The next prime is 14375957. The reversal of 14375952 is 25957341.
It is an interprime number because it is at equal distance from previous prime (14375947) and next prime (14375957).
It can be written as a sum of positive squares in only one way, i.e., 11048976 + 3326976 = 3324^2 + 1824^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (14375957) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 49773 + ... + 50060.
Almost surely, 214375952 is an apocalyptic number.
14375952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14375952 is an abundant number, since it is smaller than the sum of its proper divisors (25857150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14375952 is a wasteful number, since it uses less digits than its factorization.
14375952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99847 (or 99838 counting only the distinct ones).
The product of its digits is 37800, while the sum is 36.
The square root of 14375952 is about 3791.5632659894. The cubic root of 14375952 is about 243.1525739989.
The spelling of 14375952 in words is "fourteen million, three hundred seventy-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •