Base | Representation |
---|---|
bin | 110101101010010010… |
… | …1001010011011101111 |
3 | 102000102222020010210212 |
4 | 1223110211022123233 |
5 | 3342000312132201 |
6 | 124534420053035 |
7 | 11216434650563 |
oct | 1532445123357 |
9 | 360388203725 |
10 | 115235661551 |
11 | 4496458812a |
12 | 1a40023417b |
13 | ab3611a9aa |
14 | 58126ab6a3 |
15 | 2ee6a9eabb |
hex | 1ad494a6ef |
115235661551 has 2 divisors, whose sum is σ = 115235661552. Its totient is φ = 115235661550.
The previous prime is 115235661533. The next prime is 115235661553. The reversal of 115235661551 is 155166532511.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115235661551 is a prime.
Together with 115235661553, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 115235661499 and 115235661508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115235661553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57617830775 + 57617830776.
It is an arithmetic number, because the mean of its divisors is an integer number (57617830776).
Almost surely, 2115235661551 is an apocalyptic number.
115235661551 is a deficient number, since it is larger than the sum of its proper divisors (1).
115235661551 is an equidigital number, since it uses as much as digits as its factorization.
115235661551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 135000, while the sum is 41.
The spelling of 115235661551 in words is "one hundred fifteen billion, two hundred thirty-five million, six hundred sixty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •