Base | Representation |
---|---|
bin | 110001111000101001… |
… | …1001011100111100001 |
3 | 101020111220101112010221 |
4 | 1203301103023213201 |
5 | 3223344123134411 |
6 | 121114055123041 |
7 | 10511502112615 |
oct | 1436123134741 |
9 | 336456345127 |
10 | 107127552481 |
11 | 4148378a844 |
12 | 18918973481 |
13 | a143385111 |
14 | 5283901345 |
15 | 2bbed4c071 |
hex | 18f14cb9e1 |
107127552481 has 2 divisors, whose sum is σ = 107127552482. Its totient is φ = 107127552480.
The previous prime is 107127552451. The next prime is 107127552491. The reversal of 107127552481 is 184255721701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100565094400 + 6562458081 = 317120^2 + 81009^2 .
It is an emirp because it is prime and its reverse (184255721701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107127552481 - 27 = 107127552353 is a prime.
It is a super-2 number, since 2×1071275524812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (107127552421) 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, 53563776240 + 53563776241.
It is an arithmetic number, because the mean of its divisors is an integer number (53563776241).
Almost surely, 2107127552481 is an apocalyptic number.
It is an amenable number.
107127552481 is a deficient number, since it is larger than the sum of its proper divisors (1).
107127552481 is an equidigital number, since it uses as much as digits as its factorization.
107127552481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 156800, while the sum is 43.
The spelling of 107127552481 in words is "one hundred seven billion, one hundred twenty-seven million, five hundred fifty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •