Base | Representation |
---|---|
bin | 10011000111110100… |
… | …01001011000010111 |
3 | 222111110112000112112 |
4 | 21203322021120113 |
5 | 132011111344001 |
6 | 4414410341235 |
7 | 512255411054 |
oct | 114372113027 |
9 | 28443460475 |
10 | 10266121751 |
11 | 4398a5a246 |
12 | 1ba612a81b |
13 | c77b85c72 |
14 | 6d563802b |
15 | 401428cbb |
hex | 263e89617 |
10266121751 has 2 divisors, whose sum is σ = 10266121752. Its totient is φ = 10266121750.
The previous prime is 10266121631. The next prime is 10266121753. The reversal of 10266121751 is 15712166201.
10266121751 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10266121751 is a prime.
Together with 10266121753, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10266121753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5133060875 + 5133060876.
It is an arithmetic number, because the mean of its divisors is an integer number (5133060876).
Almost surely, 210266121751 is an apocalyptic number.
10266121751 is a deficient number, since it is larger than the sum of its proper divisors (1).
10266121751 is an equidigital number, since it uses as much as digits as its factorization.
10266121751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
Adding to 10266121751 its reverse (15712166201), we get a palindrome (25978287952).
The spelling of 10266121751 in words is "ten billion, two hundred sixty-six million, one hundred twenty-one thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •