Base | Representation |
---|---|
bin | 10000100001110011000… |
… | …001011110111001101001 |
3 | 11000120200221012211212111 |
4 | 100201303001132321221 |
5 | 122102110042302242 |
6 | 2225440240042321 |
7 | 145026132231355 |
oct | 20416301367151 |
9 | 4016627184774 |
10 | 1135801134697 |
11 | 3a8766148419 |
12 | 1641616033a1 |
13 | 8314ac8b448 |
14 | 3cd8a156465 |
15 | 1e828a2e817 |
hex | 1087305ee69 |
1135801134697 has 2 divisors, whose sum is σ = 1135801134698. Its totient is φ = 1135801134696.
The previous prime is 1135801134623. The next prime is 1135801134709. The reversal of 1135801134697 is 7964311085311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 979791144336 + 156009990361 = 989844^2 + 394981^2 .
It is a cyclic number.
It is not a de Polignac number, because 1135801134697 - 27 = 1135801134569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1135801134697.
It is not a weakly prime, because it can be changed into another prime (1135801134607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567900567348 + 567900567349.
It is an arithmetic number, because the mean of its divisors is an integer number (567900567349).
Almost surely, 21135801134697 is an apocalyptic number.
It is an amenable number.
1135801134697 is a deficient number, since it is larger than the sum of its proper divisors (1).
1135801134697 is an equidigital number, since it uses as much as digits as its factorization.
1135801134697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 49.
The spelling of 1135801134697 in words is "one trillion, one hundred thirty-five billion, eight hundred one million, one hundred thirty-four thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •