Base | Representation |
---|---|
bin | 10110010111111010111… |
… | …01001000001100111011 |
3 | 2201111021221212221212002 |
4 | 23023331131020030323 |
5 | 100043403122400412 |
6 | 1345054542411215 |
7 | 106353334003202 |
oct | 13137535101473 |
9 | 2644257787762 |
10 | 768756450107 |
11 | 277033a7a288 |
12 | 104ba6b90b0b |
13 | 57655082849 |
14 | 292caad2239 |
15 | 14ee5428dc2 |
hex | b2fd74833b |
768756450107 has 2 divisors, whose sum is σ = 768756450108. Its totient is φ = 768756450106.
The previous prime is 768756450071. The next prime is 768756450127. The reversal of 768756450107 is 701054657867.
Together with previous prime (768756450071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (701054657867) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 768756450107 - 212 = 768756446011 is a prime.
It is a super-2 number, since 2×7687564501072 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (768756450127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 384378225053 + 384378225054.
It is an arithmetic number, because the mean of its divisors is an integer number (384378225054).
Almost surely, 2768756450107 is an apocalyptic number.
768756450107 is a deficient number, since it is larger than the sum of its proper divisors (1).
768756450107 is an equidigital number, since it uses as much as digits as its factorization.
768756450107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9878400, while the sum is 56.
The spelling of 768756450107 in words is "seven hundred sixty-eight billion, seven hundred fifty-six million, four hundred fifty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •