Base | Representation |
---|---|
bin | 100100011110… |
… | …1001011101001 |
3 | 1022222122112012 |
4 | 1020331023221 |
5 | 14343444334 |
6 | 1521525305 |
7 | 321362633 |
oct | 110751351 |
9 | 38878465 |
10 | 19124969 |
11 | a882966 |
12 | 64a3835 |
13 | 3c68066 |
14 | 277ba53 |
15 | 1a2b9ce |
hex | 123d2e9 |
19124969 has 2 divisors, whose sum is σ = 19124970. Its totient is φ = 19124968.
The previous prime is 19124951. The next prime is 19124971. The reversal of 19124969 is 96942191.
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., 10004569 + 9120400 = 3163^2 + 3020^2 .
It is an emirp because it is prime and its reverse (96942191) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19124969 - 220 = 18076393 is a prime.
It is a super-2 number, since 2×191249692 = 731528878501922, which contains 22 as substring.
Together with 19124971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (19124929) 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, 9562484 + 9562485.
It is an arithmetic number, because the mean of its divisors is an integer number (9562485).
Almost surely, 219124969 is an apocalyptic number.
It is an amenable number.
19124969 is a deficient number, since it is larger than the sum of its proper divisors (1).
19124969 is an equidigital number, since it uses as much as digits as its factorization.
19124969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34992, while the sum is 41.
The square root of 19124969 is about 4373.2103768284. The cubic root of 19124969 is about 267.4239175713.
The spelling of 19124969 in words is "nineteen million, one hundred twenty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •