Base | Representation |
---|---|
bin | 10010011110011000010100… |
… | …100110001010100100100001 |
3 | 101122200122222222220212211002 |
4 | 102132120110212022210201 |
5 | 41122220143413323232 |
6 | 444450522232201345 |
7 | 23054205415533326 |
oct | 2236302446124441 |
9 | 348618888825732 |
10 | 81252536854817 |
11 | 23987009894909 |
12 | 9143352239255 |
13 | 3645109951163 |
14 | 160c9026d4b4d |
15 | 95d871a74b62 |
hex | 49e61498a921 |
81252536854817 has 2 divisors, whose sum is σ = 81252536854818. Its totient is φ = 81252536854816.
The previous prime is 81252536854751. The next prime is 81252536854873. The reversal of 81252536854817 is 71845863525218.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81106667093776 + 145869761041 = 9005924^2 + 381929^2 .
It is a cyclic number.
It is not a de Polignac number, because 81252536854817 - 28 = 81252536854561 is a prime.
It is a super-2 number, since 2×812525368548172 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (81252836854817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40626268427408 + 40626268427409.
It is an arithmetic number, because the mean of its divisors is an integer number (40626268427409).
Almost surely, 281252536854817 is an apocalyptic number.
It is an amenable number.
81252536854817 is a deficient number, since it is larger than the sum of its proper divisors (1).
81252536854817 is an equidigital number, since it uses as much as digits as its factorization.
81252536854817 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 129024000, while the sum is 65.
The spelling of 81252536854817 in words is "eighty-one trillion, two hundred fifty-two billion, five hundred thirty-six million, eight hundred fifty-four thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •