Base | Representation |
---|---|
bin | 10010111001000011111100… |
… | …010010001100000000101001 |
3 | 101220011221200202211101011202 |
4 | 102321003330102030000221 |
5 | 41342240242440000131 |
6 | 452413115045133545 |
7 | 23333525342240606 |
oct | 2271037422140051 |
9 | 356157622741152 |
10 | 83086080000041 |
11 | 24523677123a18 |
12 | 939a7800ba2b5 |
13 | 3748ca3323091 |
14 | 167355dcdb6ad |
15 | 9913d62d7bcb |
hex | 4b90fc48c029 |
83086080000041 has 2 divisors, whose sum is σ = 83086080000042. Its totient is φ = 83086080000040.
The previous prime is 83086079999963. The next prime is 83086080000073. The reversal of 83086080000041 is 14000008068038.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48289990810000 + 34796089190041 = 6949100^2 + 5898821^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-83086080000041 is a prime.
It is not a weakly prime, because it can be changed into another prime (83086080060041) 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, 41543040000020 + 41543040000021.
It is an arithmetic number, because the mean of its divisors is an integer number (41543040000021).
Almost surely, 283086080000041 is an apocalyptic number.
It is an amenable number.
83086080000041 is a deficient number, since it is larger than the sum of its proper divisors (1).
83086080000041 is an equidigital number, since it uses as much as digits as its factorization.
83086080000041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 38.
Adding to 83086080000041 its reverse (14000008068038), we get a palindrome (97086088068079).
The spelling of 83086080000041 in words is "eighty-three trillion, eighty-six billion, eighty million, forty-one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •