Base | Representation |
---|---|
bin | 100000010101101… |
… | …1101110011001101 |
3 | 2210121212121212002 |
4 | 1000223131303031 |
5 | 4210243323302 |
6 | 255402122045 |
7 | 35614335014 |
oct | 10053356315 |
9 | 2717777762 |
10 | 1085136077 |
11 | 507592883 |
12 | 2634b0325 |
13 | 143a7826c |
14 | a418da7b |
15 | 653ebc02 |
hex | 40addccd |
1085136077 has 2 divisors, whose sum is σ = 1085136078. Its totient is φ = 1085136076.
The previous prime is 1085135969. The next prime is 1085136079. The reversal of 1085136077 is 7706315801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 901560676 + 183575401 = 30026^2 + 13549^2 .
It is a cyclic number.
It is not a de Polignac number, because 1085136077 - 224 = 1068358861 is a prime.
It is a super-3 number, since 3×10851360773 (a number of 28 digits) contains 333 as substring.
Together with 1085136079, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1085136077.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1085136079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 542568038 + 542568039.
It is an arithmetic number, because the mean of its divisors is an integer number (542568039).
Almost surely, 21085136077 is an apocalyptic number.
It is an amenable number.
1085136077 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085136077 is an equidigital number, since it uses as much as digits as its factorization.
1085136077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35280, while the sum is 38.
The square root of 1085136077 is about 32941.4036889748. The cubic root of 1085136077 is about 1027.6093981155.
The spelling of 1085136077 in words is "one billion, eighty-five million, one hundred thirty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •