Base | Representation |
---|---|
bin | 10000111001100110111… |
… | …010100110101101100101 |
3 | 11010000200201102110111201 |
4 | 100321212322212231211 |
5 | 123011440124340434 |
6 | 2245305222402501 |
7 | 146622530332132 |
oct | 20714672465545 |
9 | 4100621373451 |
10 | 1161367808869 |
11 | 408595940104 |
12 | 1690b7890431 |
13 | 85693a22808 |
14 | 402d388d589 |
15 | 2032333a614 |
hex | 10e66ea6b65 |
1161367808869 has 2 divisors, whose sum is σ = 1161367808870. Its totient is φ = 1161367808868.
The previous prime is 1161367808863. The next prime is 1161367808981. The reversal of 1161367808869 is 9688087631611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 632748657025 + 528619151844 = 795455^2 + 727062^2 .
It is a cyclic number.
It is not a de Polignac number, because 1161367808869 - 223 = 1161359420261 is a prime.
It is a super-2 number, since 2×11613678088692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1161367808869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1161367808863) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 580683904434 + 580683904435.
It is an arithmetic number, because the mean of its divisors is an integer number (580683904435).
Almost surely, 21161367808869 is an apocalyptic number.
It is an amenable number.
1161367808869 is a deficient number, since it is larger than the sum of its proper divisors (1).
1161367808869 is an equidigital number, since it uses as much as digits as its factorization.
1161367808869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20901888, while the sum is 64.
The spelling of 1161367808869 in words is "one trillion, one hundred sixty-one billion, three hundred sixty-seven million, eight hundred eight thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •