Base | Representation |
---|---|
bin | 10000011110101100010… |
… | …000101111011011011001 |
3 | 11000021002112110020220121 |
4 | 100132230100233123121 |
5 | 122023242403443234 |
6 | 2224125314353241 |
7 | 144550401104602 |
oct | 20365420573331 |
9 | 4007075406817 |
10 | 1132466468569 |
11 | 3a73048863a7 |
12 | 16359088b821 |
13 | 82a3915c317 |
14 | 3cb51314da9 |
15 | 1e6d0dd04b4 |
hex | 107ac42f6d9 |
1132466468569 has 2 divisors, whose sum is σ = 1132466468570. Its totient is φ = 1132466468568.
The previous prime is 1132466468513. The next prime is 1132466468597. The reversal of 1132466468569 is 9658646642311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1062394025625 + 70072442944 = 1030725^2 + 264712^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132466468569 is a prime.
It is a super-2 number, since 2×11324664685692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1132466468509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566233234284 + 566233234285.
It is an arithmetic number, because the mean of its divisors is an integer number (566233234285).
Almost surely, 21132466468569 is an apocalyptic number.
It is an amenable number.
1132466468569 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132466468569 is an equidigital number, since it uses as much as digits as its factorization.
1132466468569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 44789760, while the sum is 61.
The spelling of 1132466468569 in words is "one trillion, one hundred thirty-two billion, four hundred sixty-six million, four hundred sixty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •