Base | Representation |
---|---|
bin | 10000100001010111100… |
… | …100101000010101101101 |
3 | 11000112111211121120022021 |
4 | 100201113210220111231 |
5 | 122100134142230344 |
6 | 2225322424550141 |
7 | 145011540516664 |
oct | 20412744502555 |
9 | 4015454546267 |
10 | 1135340586349 |
11 | 3a854a187652 |
12 | 164053322351 |
13 | 830a673a428 |
14 | 3cd44d0dddb |
15 | 1e7ed3aab84 |
hex | 1085792856d |
1135340586349 has 2 divisors, whose sum is σ = 1135340586350. Its totient is φ = 1135340586348.
The previous prime is 1135340586329. The next prime is 1135340586353. The reversal of 1135340586349 is 9436850435311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 878400072900 + 256940513449 = 937230^2 + 506893^2 .
It is a cyclic number.
It is not a de Polignac number, because 1135340586349 - 213 = 1135340578157 is a prime.
It is a super-2 number, since 2×11353405863492 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1135340586296 and 1135340586305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1135340586329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567670293174 + 567670293175.
It is an arithmetic number, because the mean of its divisors is an integer number (567670293175).
Almost surely, 21135340586349 is an apocalyptic number.
It is an amenable number.
1135340586349 is a deficient number, since it is larger than the sum of its proper divisors (1).
1135340586349 is an equidigital number, since it uses as much as digits as its factorization.
1135340586349 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 52.
The spelling of 1135340586349 in words is "one trillion, one hundred thirty-five billion, three hundred forty million, five hundred eighty-six thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •