Base | Representation |
---|---|
bin | 10111110101110100000010… |
… | …001110100011111010111011 |
3 | 111202020212010000011221022122 |
4 | 113311310002032203322323 |
5 | 102220403043414000302 |
6 | 1011000500500311455 |
7 | 31041245630222402 |
oct | 2765640216437273 |
9 | 452225100157278 |
10 | 104853073968827 |
11 | 30455a36817898 |
12 | b91528a3a258b |
13 | 46677aa770412 |
14 | 1bc6cb7186639 |
15 | c1c7082173a2 |
hex | 5f5d023a3ebb |
104853073968827 has 2 divisors, whose sum is σ = 104853073968828. Its totient is φ = 104853073968826.
The previous prime is 104853073968781. The next prime is 104853073968847. The reversal of 104853073968827 is 728869370358401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104853073968827 - 26 = 104853073968763 is a prime.
It is not a weakly prime, because it can be changed into another prime (104853073968847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52426536984413 + 52426536984414.
It is an arithmetic number, because the mean of its divisors is an integer number (52426536984414).
It is a 1-persistent number, because it is pandigital, but 2⋅104853073968827 = 209706147937654 is not.
Almost surely, 2104853073968827 is an apocalyptic number.
104853073968827 is a deficient number, since it is larger than the sum of its proper divisors (1).
104853073968827 is an equidigital number, since it uses as much as digits as its factorization.
104853073968827 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 487710720, while the sum is 71.
The spelling of 104853073968827 in words is "one hundred four trillion, eight hundred fifty-three billion, seventy-three million, nine hundred sixty-eight thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •