Base | Representation |
---|---|
bin | 10010010010011111010111… |
… | …100000001001111111100001 |
3 | 101112210120000001212200221202 |
4 | 102102133113200021333201 |
5 | 41020323314312130134 |
6 | 443023313252530545 |
7 | 22641161611550543 |
oct | 2222372740117741 |
9 | 345716001780852 |
10 | 80435468083169 |
11 | 236a154386a371 |
12 | 9030b23620a55 |
13 | 35b6055682a04 |
14 | 15c11514ab693 |
15 | 9474a0023d7e |
hex | 4927d7809fe1 |
80435468083169 has 2 divisors, whose sum is σ = 80435468083170. Its totient is φ = 80435468083168.
The previous prime is 80435468083037. The next prime is 80435468083171. The reversal of 80435468083169 is 96138086453408.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70172671409569 + 10262796673600 = 8376913^2 + 3203560^2 .
It is a cyclic number.
It is not a de Polignac number, because 80435468083169 - 224 = 80435451305953 is a prime.
It is a super-2 number, since 2×804354680831692 (a number of 29 digits) contains 22 as substring.
Together with 80435468083171, 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 (80435468043169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40217734041584 + 40217734041585.
It is an arithmetic number, because the mean of its divisors is an integer number (40217734041585).
Almost surely, 280435468083169 is an apocalyptic number.
It is an amenable number.
80435468083169 is a deficient number, since it is larger than the sum of its proper divisors (1).
80435468083169 is an equidigital number, since it uses as much as digits as its factorization.
80435468083169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 119439360, while the sum is 65.
The spelling of 80435468083169 in words is "eighty trillion, four hundred thirty-five billion, four hundred sixty-eight million, eighty-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •