Base | Representation |
---|---|
bin | 11000100100010111010010… |
… | …010011010111001011000001 |
3 | 112011120200011002120000012002 |
4 | 120210113102103113023001 |
5 | 103130311014230301411 |
6 | 1021450225111513345 |
7 | 31521333540453461 |
oct | 3044272223271301 |
9 | 464520132500162 |
10 | 108052020556481 |
11 | 3147967176a451 |
12 | 10151257088855 |
13 | 483a3532a0971 |
14 | 1c97a622abba1 |
15 | c75a3369d33b |
hex | 6245d24d72c1 |
108052020556481 has 2 divisors, whose sum is σ = 108052020556482. Its totient is φ = 108052020556480.
The previous prime is 108052020556471. The next prime is 108052020556489. The reversal of 108052020556481 is 184655020250801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95734307240881 + 12317713315600 = 9784391^2 + 3509660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-108052020556481 is a prime.
It is a super-2 number, since 2×1080520205564812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (108052020556489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54026010278240 + 54026010278241.
It is an arithmetic number, because the mean of its divisors is an integer number (54026010278241).
Almost surely, 2108052020556481 is an apocalyptic number.
It is an amenable number.
108052020556481 is a deficient number, since it is larger than the sum of its proper divisors (1).
108052020556481 is an equidigital number, since it uses as much as digits as its factorization.
108052020556481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768000, while the sum is 47.
The spelling of 108052020556481 in words is "one hundred eight trillion, fifty-two billion, twenty million, five hundred fifty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •