Base | Representation |
---|---|
bin | 10000010000111010010… |
… | …010100000100111010101 |
3 | 10221211220022012200202202 |
4 | 100100322102200213111 |
5 | 121302441333141134 |
6 | 2213241130414245 |
7 | 143514614245634 |
oct | 20207222404725 |
9 | 3854808180682 |
10 | 1117669427669 |
11 | 3a1001288583 |
12 | 160741291385 |
13 | 8151b695412 |
14 | 3c14a04351b |
15 | 1e116d0bd7e |
hex | 1043a4a09d5 |
1117669427669 has 2 divisors, whose sum is σ = 1117669427670. Its totient is φ = 1117669427668.
The previous prime is 1117669427647. The next prime is 1117669427671. The reversal of 1117669427669 is 9667249667111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 945830161444 + 171839266225 = 972538^2 + 414535^2 .
It is a cyclic number.
It is not a de Polignac number, because 1117669427669 - 212 = 1117669423573 is a prime.
It is a super-2 number, since 2×11176694276692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1117669427671, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1117669427569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 558834713834 + 558834713835.
It is an arithmetic number, because the mean of its divisors is an integer number (558834713835).
Almost surely, 21117669427669 is an apocalyptic number.
It is an amenable number.
1117669427669 is a deficient number, since it is larger than the sum of its proper divisors (1).
1117669427669 is an equidigital number, since it uses as much as digits as its factorization.
1117669427669 is an evil number, because the sum of its binary digits is even.
The product of its digits is 41150592, while the sum is 65.
The spelling of 1117669427669 in words is "one trillion, one hundred seventeen billion, six hundred sixty-nine million, four hundred twenty-seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •