Base | Representation |
---|---|
bin | 10011101100101000100010… |
… | …111100011111011100000001 |
3 | 102100201202100222202101220212 |
4 | 103230220202330133130001 |
5 | 42323321344110034243 |
6 | 504125150252443505 |
7 | 24150550025540555 |
oct | 2354504274373401 |
9 | 370652328671825 |
10 | 86630076643073 |
11 | 2566a6779071a7 |
12 | 98715a5479595 |
13 | 394524806aa22 |
14 | 1756cbd303865 |
15 | a036a8e57318 |
hex | 4eca22f1f701 |
86630076643073 has 2 divisors, whose sum is σ = 86630076643074. Its totient is φ = 86630076643072.
The previous prime is 86630076643057. The next prime is 86630076643109. The reversal of 86630076643073 is 37034667003668.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86539985419969 + 90091223104 = 9302687^2 + 300152^2 .
It is a cyclic number.
It is not a de Polignac number, because 86630076643073 - 24 = 86630076643057 is a prime.
It is a super-3 number, since 3×866300766430733 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (86630076643003) 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, 43315038321536 + 43315038321537.
It is an arithmetic number, because the mean of its divisors is an integer number (43315038321537).
Almost surely, 286630076643073 is an apocalyptic number.
It is an amenable number.
86630076643073 is a deficient number, since it is larger than the sum of its proper divisors (1).
86630076643073 is an equidigital number, since it uses as much as digits as its factorization.
86630076643073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54867456, while the sum is 59.
The spelling of 86630076643073 in words is "eighty-six trillion, six hundred thirty billion, seventy-six million, six hundred forty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •