Base | Representation |
---|---|
bin | 110000110100111111… |
… | …0011101011010101001 |
3 | 101000122200022110211022 |
4 | 1201221332131122221 |
5 | 3204221420234301 |
6 | 120100513342225 |
7 | 10401313314242 |
oct | 1415176353251 |
9 | 330580273738 |
10 | 104857196201 |
11 | 4051917653a |
12 | 183a4567975 |
13 | 9b70bbba34 |
14 | 510a18bcc9 |
15 | 2ada883d1b |
hex | 1869f9d6a9 |
104857196201 has 2 divisors, whose sum is σ = 104857196202. Its totient is φ = 104857196200.
The previous prime is 104857196189. The next prime is 104857196207. The reversal of 104857196201 is 102691758401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56434753600 + 48422442601 = 237560^2 + 220051^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104857196201 is a prime.
It is not a weakly prime, because it can be changed into another prime (104857196207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52428598100 + 52428598101.
It is an arithmetic number, because the mean of its divisors is an integer number (52428598101).
Almost surely, 2104857196201 is an apocalyptic number.
It is an amenable number.
104857196201 is a deficient number, since it is larger than the sum of its proper divisors (1).
104857196201 is an equidigital number, since it uses as much as digits as its factorization.
104857196201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 44.
The spelling of 104857196201 in words is "one hundred four billion, eight hundred fifty-seven million, one hundred ninety-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •