Base | Representation |
---|---|
bin | 10111110100111110110101… |
… | …001011110001000000000001 |
3 | 111202001101122201100212022122 |
4 | 113310332311023301000001 |
5 | 102213434044341043424 |
6 | 1010514332055214025 |
7 | 31034154153354056 |
oct | 2764766513610001 |
9 | 452041581325278 |
10 | 104795946815489 |
11 | 30433790a52a76 |
12 | b9061a6677315 |
13 | 46622a52678c7 |
14 | 1bc421807b02d |
15 | c1aeb2cdd45e |
hex | 5f4fb52f1001 |
104795946815489 has 2 divisors, whose sum is σ = 104795946815490. Its totient is φ = 104795946815488.
The previous prime is 104795946815471. The next prime is 104795946815531. The reversal of 104795946815489 is 984518649597401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81977813305600 + 22818133509889 = 9054160^2 + 4776833^2 .
It is a cyclic number.
It is not a de Polignac number, because 104795946815489 - 28 = 104795946815233 is a prime.
It is not a weakly prime, because it can be changed into another prime (104795946818489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52397973407744 + 52397973407745.
It is an arithmetic number, because the mean of its divisors is an integer number (52397973407745).
Almost surely, 2104795946815489 is an apocalyptic number.
It is an amenable number.
104795946815489 is a deficient number, since it is larger than the sum of its proper divisors (1).
104795946815489 is an equidigital number, since it uses as much as digits as its factorization.
104795946815489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3135283200, while the sum is 80.
The spelling of 104795946815489 in words is "one hundred four trillion, seven hundred ninety-five billion, nine hundred forty-six million, eight hundred fifteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •