Base | Representation |
---|---|
bin | 110000110001101111… |
… | …0010101010010101011 |
3 | 101000101002001101002101 |
4 | 1201203132111102223 |
5 | 3204011004023034 |
6 | 120042015314231 |
7 | 10365520152526 |
oct | 1414336252253 |
9 | 330332041071 |
10 | 104748111019 |
11 | 4047263a1a2 |
12 | 18373b1b977 |
13 | 9b54416ba6 |
14 | 50d98b3bbd |
15 | 2ad0ed7514 |
hex | 18637954ab |
104748111019 has 2 divisors, whose sum is σ = 104748111020. Its totient is φ = 104748111018.
The previous prime is 104748110993. The next prime is 104748111029. The reversal of 104748111019 is 910111847401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104748111019 - 27 = 104748110891 is a prime.
It is a super-2 number, since 2×1047481110192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104748111029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52374055509 + 52374055510.
It is an arithmetic number, because the mean of its divisors is an integer number (52374055510).
Almost surely, 2104748111019 is an apocalyptic number.
104748111019 is a deficient number, since it is larger than the sum of its proper divisors (1).
104748111019 is an equidigital number, since it uses as much as digits as its factorization.
104748111019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 37.
The spelling of 104748111019 in words is "one hundred four billion, seven hundred forty-eight million, one hundred eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •