Base | Representation |
---|---|
bin | 110000110101100100… |
… | …0111111010000010001 |
3 | 101000201001002001220101 |
4 | 1201223020333100101 |
5 | 3204241420432312 |
6 | 120102452212401 |
7 | 10401641345206 |
oct | 1415310772021 |
9 | 330631061811 |
10 | 104876733457 |
11 | 40529200131 |
12 | 183ab00a101 |
13 | 9b74c6c642 |
14 | 510c9d5cad |
15 | 2adc442a57 |
hex | 186b23f411 |
104876733457 has 2 divisors, whose sum is σ = 104876733458. Its totient is φ = 104876733456.
The previous prime is 104876733277. The next prime is 104876733473. The reversal of 104876733457 is 754337678401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104871697921 + 5035536 = 323839^2 + 2244^2 .
It is a cyclic number.
It is not a de Polignac number, because 104876733457 - 231 = 102729249809 is a prime.
It is a super-2 number, since 2×1048767334572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104876733398 and 104876733407.
It is not a weakly prime, because it can be changed into another prime (104876733497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52438366728 + 52438366729.
It is an arithmetic number, because the mean of its divisors is an integer number (52438366729).
Almost surely, 2104876733457 is an apocalyptic number.
It is an amenable number.
104876733457 is a deficient number, since it is larger than the sum of its proper divisors (1).
104876733457 is an equidigital number, since it uses as much as digits as its factorization.
104876733457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11854080, while the sum is 55.
The spelling of 104876733457 in words is "one hundred four billion, eight hundred seventy-six million, seven hundred thirty-three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •