Base | Representation |
---|---|
bin | 10010011111100010101000… |
… | …010111010111000101101111 |
3 | 101122222021221121011121111012 |
4 | 102133202220113113011233 |
5 | 41130022100301210411 |
6 | 444551315434015435 |
7 | 23063031562225214 |
oct | 2237425027270557 |
9 | 348867847147435 |
10 | 81332325413231 |
11 | 23a07933403782 |
12 | 91568bb27757b |
13 | 364c7b4023bb9 |
14 | 161271134db0b |
15 | 9609916c918b |
hex | 49f8a85d716f |
81332325413231 has 2 divisors, whose sum is σ = 81332325413232. Its totient is φ = 81332325413230.
The previous prime is 81332325413201. The next prime is 81332325413321. The reversal of 81332325413231 is 13231452323318.
Together with next prime (81332325413321) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 81332325413231 - 222 = 81332321218927 is a prime.
It is a super-2 number, since 2×813323254132312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (81332325413201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40666162706615 + 40666162706616.
It is an arithmetic number, because the mean of its divisors is an integer number (40666162706616).
Almost surely, 281332325413231 is an apocalyptic number.
81332325413231 is a deficient number, since it is larger than the sum of its proper divisors (1).
81332325413231 is an equidigital number, since it uses as much as digits as its factorization.
81332325413231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 311040, while the sum is 41.
Adding to 81332325413231 its reverse (13231452323318), we get a palindrome (94563777736549).
The spelling of 81332325413231 in words is "eighty-one trillion, three hundred thirty-two billion, three hundred twenty-five million, four hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •