Base | Representation |
---|---|
bin | 10010100011101010110111… |
… | …101111010110101011111001 |
3 | 101200222102021221022002110011 |
4 | 102203222313233112223321 |
5 | 41144144133101442214 |
6 | 445325521334221521 |
7 | 23122364555522134 |
oct | 2243526757265371 |
9 | 350872257262404 |
10 | 81616051202809 |
11 | 2400719a1a58a2 |
12 | 91a18a24b48a1 |
13 | 367048c32b1a6 |
14 | 1622348d4121b |
15 | 96804a279ac4 |
hex | 4a3ab7bd6af9 |
81616051202809 has 2 divisors, whose sum is σ = 81616051202810. Its totient is φ = 81616051202808.
The previous prime is 81616051202729. The next prime is 81616051202827. The reversal of 81616051202809 is 90820215061618.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44549324022784 + 37066727180025 = 6674528^2 + 6088245^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-81616051202809 is a prime.
It is a super-2 number, since 2×816160512028092 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (81616051202849) 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, 40808025601404 + 40808025601405.
It is an arithmetic number, because the mean of its divisors is an integer number (40808025601405).
Almost surely, 281616051202809 is an apocalyptic number.
It is an amenable number.
81616051202809 is a deficient number, since it is larger than the sum of its proper divisors (1).
81616051202809 is an equidigital number, since it uses as much as digits as its factorization.
81616051202809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 49.
The spelling of 81616051202809 in words is "eighty-one trillion, six hundred sixteen billion, fifty-one million, two hundred two thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •