Base | Representation |
---|---|
bin | 1011011101011100000000100… |
… | …1110111100011001011100001 |
3 | 10220202022022022002200010200221 |
4 | 2313113000021313203023201 |
5 | 1321144414231103211141 |
6 | 11535041414254443041 |
7 | 331601104165652506 |
oct | 26727001167431341 |
9 | 3822268262603627 |
10 | 806423225053921 |
11 | 213a51195150882 |
12 | 76542282503481 |
13 | 287c84cb342987 |
14 | 1031d1415974ad |
15 | 6336dbaa55bd1 |
hex | 2dd7009de32e1 |
806423225053921 has 2 divisors, whose sum is σ = 806423225053922. Its totient is φ = 806423225053920.
The previous prime is 806423225053807. The next prime is 806423225053949. The reversal of 806423225053921 is 129350522324608.
806423225053921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 778810974624225 + 27612250429696 = 27907185^2 + 5254736^2 .
It is a cyclic number.
It is not a de Polignac number, because 806423225053921 - 213 = 806423225045729 is a prime.
It is not a weakly prime, because it can be changed into another prime (806423225053991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 403211612526960 + 403211612526961.
It is an arithmetic number, because the mean of its divisors is an integer number (403211612526961).
Almost surely, 2806423225053921 is an apocalyptic number.
It is an amenable number.
806423225053921 is a deficient number, since it is larger than the sum of its proper divisors (1).
806423225053921 is an equidigital number, since it uses as much as digits as its factorization.
806423225053921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6220800, while the sum is 52.
The spelling of 806423225053921 in words is "eight hundred six trillion, four hundred twenty-three billion, two hundred twenty-five million, fifty-three thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •