Base | Representation |
---|---|
bin | 110111010111001100111… |
… | …111010111100111110101 |
3 | 111110201001010010211202121 |
4 | 313113030333113213311 |
5 | 444313041204031403 |
6 | 12031431213435541 |
7 | 541602455543542 |
oct | 67271477274765 |
9 | 14421033124677 |
10 | 3804485220853 |
11 | 12375227a7269 |
12 | 51540249bbb1 |
13 | 2179b8aaa0c5 |
14 | d21d0bdbbc9 |
15 | 68e6b6a53bd |
hex | 375ccfd79f5 |
3804485220853 has 2 divisors, whose sum is σ = 3804485220854. Its totient is φ = 3804485220852.
The previous prime is 3804485220787. The next prime is 3804485220857. The reversal of 3804485220853 is 3580225844083.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3796663941009 + 7821279844 = 1948503^2 + 88438^2 .
It is a cyclic number.
It is not a de Polignac number, because 3804485220853 - 241 = 1605461965301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3804485220853.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3804485220857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1902242610426 + 1902242610427.
It is an arithmetic number, because the mean of its divisors is an integer number (1902242610427).
Almost surely, 23804485220853 is an apocalyptic number.
It is an amenable number.
3804485220853 is a deficient number, since it is larger than the sum of its proper divisors (1).
3804485220853 is an equidigital number, since it uses as much as digits as its factorization.
3804485220853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7372800, while the sum is 52.
The spelling of 3804485220853 in words is "three trillion, eight hundred four billion, four hundred eighty-five million, two hundred twenty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •