Base | Representation |
---|---|
bin | 110010001011110111… |
… | …1001010000010011011 |
3 | 101022011211211012102102 |
4 | 1210113233022002123 |
5 | 3231204214422001 |
6 | 121302052554015 |
7 | 10533462312566 |
oct | 1442757120233 |
9 | 338154735372 |
10 | 107772420251 |
11 | 417847a3511 |
12 | 18a7892290b |
13 | a216b60092 |
14 | 53054074dd |
15 | 2c0b77de6b |
hex | 1917bca09b |
107772420251 has 2 divisors, whose sum is σ = 107772420252. Its totient is φ = 107772420250.
The previous prime is 107772420241. The next prime is 107772420253. The reversal of 107772420251 is 152024277701.
It is a strong prime.
It is an emirp because it is prime and its reverse (152024277701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107772420251 - 222 = 107768225947 is a prime.
It is a super-2 number, since 2×1077724202512 (a number of 23 digits) contains 22 as substring.
Together with 107772420253, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (107772420253) 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, 53886210125 + 53886210126.
It is an arithmetic number, because the mean of its divisors is an integer number (53886210126).
Almost surely, 2107772420251 is an apocalyptic number.
107772420251 is a deficient number, since it is larger than the sum of its proper divisors (1).
107772420251 is an equidigital number, since it uses as much as digits as its factorization.
107772420251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54880, while the sum is 38.
Adding to 107772420251 its reverse (152024277701), we get a palindrome (259796697952).
The spelling of 107772420251 in words is "one hundred seven billion, seven hundred seventy-two million, four hundred twenty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •