Base | Representation |
---|---|
bin | 101000000100110100… |
… | …0111000000000110011 |
3 | 22020010202001121211102 |
4 | 1100021220320000303 |
5 | 2402223112243201 |
6 | 103311431035015 |
7 | 6134446622645 |
oct | 1201150700063 |
9 | 266122047742 |
10 | 86061056051 |
11 | 3355324a213 |
12 | 1481980ba6b |
13 | 8166a5a409 |
14 | 4245b1c895 |
15 | 238a66726b |
hex | 1409a38033 |
86061056051 has 2 divisors, whose sum is σ = 86061056052. Its totient is φ = 86061056050.
The previous prime is 86061056047. The next prime is 86061056089. The reversal of 86061056051 is 15065016068.
It is an a-pointer prime, because the next prime (86061056089) can be obtained adding 86061056051 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 86061056051 - 22 = 86061056047 is a prime.
It is a super-2 number, since 2×860610560512 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 86061055996 and 86061056014.
It is not a weakly prime, because it can be changed into another prime (86061056251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43030528025 + 43030528026.
It is an arithmetic number, because the mean of its divisors is an integer number (43030528026).
Almost surely, 286061056051 is an apocalyptic number.
86061056051 is a deficient number, since it is larger than the sum of its proper divisors (1).
86061056051 is an equidigital number, since it uses as much as digits as its factorization.
86061056051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 86061056051 in words is "eighty-six billion, sixty-one million, fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •