Base | Representation |
---|---|
bin | 110000110100011000… |
… | …1000110001000011011 |
3 | 101000121021011010021002 |
4 | 1201220301012020123 |
5 | 3204201222300424 |
6 | 120054510535215 |
7 | 10400646036443 |
oct | 1415061061033 |
9 | 330537133232 |
10 | 104836915739 |
11 | 40508784526 |
12 | 1839980750b |
13 | 9b6993aa6a |
14 | 51075cd123 |
15 | 2ad8bc9cae |
hex | 1868c4621b |
104836915739 has 2 divisors, whose sum is σ = 104836915740. Its totient is φ = 104836915738.
The previous prime is 104836915723. The next prime is 104836915741. The reversal of 104836915739 is 937519638401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104836915739 - 24 = 104836915723 is a prime.
It is a super-2 number, since 2×1048369157392 (a number of 23 digits) contains 22 as substring.
Together with 104836915741, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (104836915789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52418457869 + 52418457870.
It is an arithmetic number, because the mean of its divisors is an integer number (52418457870).
Almost surely, 2104836915739 is an apocalyptic number.
104836915739 is a deficient number, since it is larger than the sum of its proper divisors (1).
104836915739 is an equidigital number, since it uses as much as digits as its factorization.
104836915739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4898880, while the sum is 56.
The spelling of 104836915739 in words is "one hundred four billion, eight hundred thirty-six million, nine hundred fifteen thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •