Base | Representation |
---|---|
bin | 111000101110… |
… | …010110001101 |
3 | 1000222110200002 |
4 | 320232112031 |
5 | 12301314101 |
6 | 1250414045 |
7 | 240251324 |
oct | 70562615 |
9 | 30873602 |
10 | 14869901 |
11 | 8436a82 |
12 | 4b91325 |
13 | 3108377 |
14 | 1d910bb |
15 | 148ad6b |
hex | e2e58d |
14869901 has 2 divisors, whose sum is σ = 14869902. Its totient is φ = 14869900.
The previous prime is 14869871. The next prime is 14869919. The reversal of 14869901 is 10996841.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14478025 + 391876 = 3805^2 + 626^2 .
It is a cyclic number.
It is not a de Polignac number, because 14869901 - 210 = 14868877 is a prime.
It is a super-2 number, since 2×148699012 = 442227911499602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p962894 and since 14869901 and 962894 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14869961) 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 as a sum of consecutive naturals, namely, 7434950 + 7434951.
It is an arithmetic number, because the mean of its divisors is an integer number (7434951).
Almost surely, 214869901 is an apocalyptic number.
It is an amenable number.
14869901 is a deficient number, since it is larger than the sum of its proper divisors (1).
14869901 is an equidigital number, since it uses as much as digits as its factorization.
14869901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 38.
The square root of 14869901 is about 3856.1510603191. The cubic root of 14869901 is about 245.9061322526.
The spelling of 14869901 in words is "fourteen million, eight hundred sixty-nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •