Base | Representation |
---|---|
bin | 10000111001100100110… |
… | …101000001101101101001 |
3 | 11010000121021112102121220 |
4 | 100321210311001231221 |
5 | 123011402143322134 |
6 | 2245301532052253 |
7 | 146621623600464 |
oct | 20714465015551 |
9 | 4100537472556 |
10 | 1161332792169 |
11 | 4085780a3590 |
12 | 1690a8004089 |
13 | 856896b2284 |
14 | 402ccd762db |
15 | 20320220149 |
hex | 10e64d41b69 |
1161332792169 has 16 divisors (see below), whose sum is σ = 1788576707520. Its totient is φ = 662435816960.
The previous prime is 1161332792107. The next prime is 1161332792171. The reversal of 1161332792169 is 9612972331611.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1161332792169 - 27 = 1161332792041 is a prime.
It is a super-2 number, since 2×11613327921692 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (1161332792569) 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 in 15 ways as a sum of consecutive naturals, for example, 1035055404 + ... + 1035056525.
It is an arithmetic number, because the mean of its divisors is an integer number (111786044220).
Almost surely, 21161332792169 is an apocalyptic number.
It is an amenable number.
1161332792169 is a deficient number, since it is larger than the sum of its proper divisors (627243915351).
1161332792169 is a wasteful number, since it uses less digits than its factorization.
1161332792169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2070111960.
The product of its digits is 734832, while the sum is 51.
The spelling of 1161332792169 in words is "one trillion, one hundred sixty-one billion, three hundred thirty-two million, seven hundred ninety-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •