Base | Representation |
---|---|
bin | 100101000111111000111… |
… | …011000111101100100101 |
3 | 100000212210222101200002211 |
4 | 211013320323013230211 |
5 | 313244114003312432 |
6 | 5231542212003421 |
7 | 352211301655342 |
oct | 45077073075445 |
9 | 10025728350084 |
10 | 2551091854117 |
11 | 8a3a03932504 |
12 | 352503600571 |
13 | 15674a70cb91 |
14 | 8b68b4217c9 |
15 | 4655e27cd47 |
hex | 251f8ec7b25 |
2551091854117 has 2 divisors, whose sum is σ = 2551091854118. Its totient is φ = 2551091854116.
The previous prime is 2551091854097. The next prime is 2551091854123. The reversal of 2551091854117 is 7114581901552.
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., 1414194261601 + 1136897592516 = 1189199^2 + 1066254^2 .
It is a cyclic number.
It is not a de Polignac number, because 2551091854117 - 215 = 2551091821349 is a prime.
It is a super-2 number, since 2×25510918541172 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2551091854147) 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, 1275545927058 + 1275545927059.
It is an arithmetic number, because the mean of its divisors is an integer number (1275545927059).
Almost surely, 22551091854117 is an apocalyptic number.
It is an amenable number.
2551091854117 is a deficient number, since it is larger than the sum of its proper divisors (1).
2551091854117 is an equidigital number, since it uses as much as digits as its factorization.
2551091854117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504000, while the sum is 49.
The spelling of 2551091854117 in words is "two trillion, five hundred fifty-one billion, ninety-one million, eight hundred fifty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •