Base | Representation |
---|---|
bin | 110101111110001110… |
… | …1011001100000010011 |
3 | 102002011121011120021202 |
4 | 1223330131121200103 |
5 | 3344333101333041 |
6 | 125125040141415 |
7 | 11242140551216 |
oct | 1537435314023 |
9 | 362147146252 |
10 | 115904714771 |
11 | 4517820a77a |
12 | 1a56830786b |
13 | ac11913181 |
14 | 58774ab77d |
15 | 30356aca9b |
hex | 1afc759813 |
115904714771 has 2 divisors, whose sum is σ = 115904714772. Its totient is φ = 115904714770.
The previous prime is 115904714747. The next prime is 115904714773. The reversal of 115904714771 is 177417409511.
It is a strong prime.
It is an emirp because it is prime and its reverse (177417409511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115904714771 - 26 = 115904714707 is a prime.
It is a super-2 number, since 2×1159047147712 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 115904714773, 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 (115904714773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57952357385 + 57952357386.
It is an arithmetic number, because the mean of its divisors is an integer number (57952357386).
Almost surely, 2115904714771 is an apocalyptic number.
115904714771 is a deficient number, since it is larger than the sum of its proper divisors (1).
115904714771 is an equidigital number, since it uses as much as digits as its factorization.
115904714771 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 246960, while the sum is 47.
The spelling of 115904714771 in words is "one hundred fifteen billion, nine hundred four million, seven hundred fourteen thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •