Base | Representation |
---|---|
bin | 110101110110110011… |
… | …0111101111101101001 |
3 | 102001112020100110021102 |
4 | 1223231212331331221 |
5 | 3343330311041121 |
6 | 125044220051145 |
7 | 11233024040423 |
oct | 1535546757551 |
9 | 361466313242 |
10 | 115655565161 |
11 | 4505a607a04 |
12 | 1a4b8993ab5 |
13 | aba210a876 |
14 | 5852373813 |
15 | 301d89590b |
hex | 1aed9bdf69 |
115655565161 has 2 divisors, whose sum is σ = 115655565162. Its totient is φ = 115655565160.
The previous prime is 115655565119. The next prime is 115655565227. The reversal of 115655565161 is 161565556511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86095296400 + 29560268761 = 293420^2 + 171931^2 .
It is an emirp because it is prime and its reverse (161565556511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115655565161 - 26 = 115655565097 is a prime.
It is not a weakly prime, because it can be changed into another prime (115655565101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57827782580 + 57827782581.
It is an arithmetic number, because the mean of its divisors is an integer number (57827782581).
Almost surely, 2115655565161 is an apocalyptic number.
It is an amenable number.
115655565161 is a deficient number, since it is larger than the sum of its proper divisors (1).
115655565161 is an equidigital number, since it uses as much as digits as its factorization.
115655565161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 675000, while the sum is 47.
The spelling of 115655565161 in words is "one hundred fifteen billion, six hundred fifty-five million, five hundred sixty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •