Base | Representation |
---|---|
bin | 11100001000110011… |
… | …00011001010010011 |
3 | 1102222202222001202022 |
4 | 32010121203022103 |
5 | 221414141121034 |
6 | 10534550042055 |
7 | 1043226341102 |
oct | 160431431223 |
9 | 42882861668 |
10 | 15106192019 |
11 | 6452062716 |
12 | 2b1704932b |
13 | 156984a079 |
14 | a34388039 |
15 | 5d62ddb2e |
hex | 384663293 |
15106192019 has 2 divisors, whose sum is σ = 15106192020. Its totient is φ = 15106192018.
The previous prime is 15106192007. The next prime is 15106192021. The reversal of 15106192019 is 91029160151.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15106192019 is a prime.
It is a super-2 number, since 2×151061920192 (a number of 21 digits) contains 22 as substring.
Together with 15106192021, 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 15106192019.
It is not a weakly prime, because it can be changed into another prime (15106192039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7553096009 + 7553096010.
It is an arithmetic number, because the mean of its divisors is an integer number (7553096010).
Almost surely, 215106192019 is an apocalyptic number.
15106192019 is a deficient number, since it is larger than the sum of its proper divisors (1).
15106192019 is an equidigital number, since it uses as much as digits as its factorization.
15106192019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 35.
The spelling of 15106192019 in words is "fifteen billion, one hundred six million, one hundred ninety-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •