Base | Representation |
---|---|
bin | 100101101110011100… |
… | …0100011111001100001 |
3 | 21202010002102220012012 |
4 | 1023130320203321201 |
5 | 2311404344212303 |
6 | 101115021242305 |
7 | 5565430026014 |
oct | 1133470437141 |
9 | 252102386165 |
10 | 81015225953 |
11 | 313a3a8a3a2 |
12 | 1384ba03395 |
13 | 784157342c |
14 | 3cc792b37b |
15 | 21926ab5d8 |
hex | 12dce23e61 |
81015225953 has 2 divisors, whose sum is σ = 81015225954. Its totient is φ = 81015225952.
The previous prime is 81015225943. The next prime is 81015226003. The reversal of 81015225953 is 35952251018.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80660544064 + 354681889 = 284008^2 + 18833^2 .
It is a cyclic number.
It is not a de Polignac number, because 81015225953 - 222 = 81011031649 is a prime.
It is a super-5 number, since 5×810152259535 (a number of 56 digits) contains 55555 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 81015225953.
It is not a weakly prime, because it can be changed into another prime (81015225913) 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, 40507612976 + 40507612977.
It is an arithmetic number, because the mean of its divisors is an integer number (40507612977).
Almost surely, 281015225953 is an apocalyptic number.
It is an amenable number.
81015225953 is a deficient number, since it is larger than the sum of its proper divisors (1).
81015225953 is an equidigital number, since it uses as much as digits as its factorization.
81015225953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 41.
The spelling of 81015225953 in words is "eighty-one billion, fifteen million, two hundred twenty-five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •