Base | Representation |
---|---|
bin | 100101101110111000… |
… | …1101001111001101111 |
3 | 21202011010121021210001 |
4 | 1023131301221321233 |
5 | 2311422212132001 |
6 | 101120314125131 |
7 | 5566001163004 |
oct | 1133561517157 |
9 | 252133537701 |
10 | 81030192751 |
11 | 31401482152 |
12 | 13854a207a7 |
13 | 78446b3921 |
14 | 3cc99058ab |
15 | 2193b66001 |
hex | 12ddc69e6f |
81030192751 has 2 divisors, whose sum is σ = 81030192752. Its totient is φ = 81030192750.
The previous prime is 81030192731. The next prime is 81030192767. The reversal of 81030192751 is 15729103018.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 81030192751 - 227 = 80895975023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 81030192751.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (81030192701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40515096375 + 40515096376.
It is an arithmetic number, because the mean of its divisors is an integer number (40515096376).
Almost surely, 281030192751 is an apocalyptic number.
81030192751 is a deficient number, since it is larger than the sum of its proper divisors (1).
81030192751 is an equidigital number, since it uses as much as digits as its factorization.
81030192751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 37.
Adding to 81030192751 its reverse (15729103018), we get a palindrome (96759295769).
The spelling of 81030192751 in words is "eighty-one billion, thirty million, one hundred ninety-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •