Base | Representation |
---|---|
bin | 11011000010010101… |
… | …10100001010000111 |
3 | 1101110120202211212022 |
4 | 31201022310022013 |
5 | 214211333030134 |
6 | 10400153313355 |
7 | 1022461354166 |
oct | 154112641207 |
9 | 41416684768 |
10 | 14515126919 |
11 | 6179457767 |
12 | 299110585b |
13 | 14a425c2c7 |
14 | 9b9a893dd |
15 | 59e48852e |
hex | 3612b4287 |
14515126919 has 2 divisors, whose sum is σ = 14515126920. Its totient is φ = 14515126918.
The previous prime is 14515126909. The next prime is 14515126921. The reversal of 14515126919 is 91962151541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14515126919 - 24 = 14515126903 is a prime.
It is a super-2 number, since 2×145151269192 (a number of 21 digits) contains 22 as substring.
Together with 14515126921, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14515126919.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14515126909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7257563459 + 7257563460.
It is an arithmetic number, because the mean of its divisors is an integer number (7257563460).
Almost surely, 214515126919 is an apocalyptic number.
14515126919 is a deficient number, since it is larger than the sum of its proper divisors (1).
14515126919 is an equidigital number, since it uses as much as digits as its factorization.
14515126919 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 97200, while the sum is 44.
The spelling of 14515126919 in words is "fourteen billion, five hundred fifteen million, one hundred twenty-six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •