Base | Representation |
---|---|
bin | 101100101000… |
… | …010111010101 |
3 | 211000101221002 |
4 | 230220113111 |
5 | 10443342134 |
6 | 1054433045 |
7 | 201305552 |
oct | 54502725 |
9 | 24011832 |
10 | 11699669 |
11 | 6671153 |
12 | 3b02785 |
13 | 25683a7 |
14 | 17a7a29 |
15 | 106187e |
hex | b285d5 |
11699669 has 2 divisors, whose sum is σ = 11699670. Its totient is φ = 11699668.
The previous prime is 11699609. The next prime is 11699671. The reversal of 11699669 is 96699611.
11699669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7344100 + 4355569 = 2710^2 + 2087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11699669 is a prime.
It is a super-2 number, since 2×116996692 = 273764509419122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 11699671, 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 (11699609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5849834 + 5849835.
It is an arithmetic number, because the mean of its divisors is an integer number (5849835).
Almost surely, 211699669 is an apocalyptic number.
It is an amenable number.
11699669 is a deficient number, since it is larger than the sum of its proper divisors (1).
11699669 is an equidigital number, since it uses as much as digits as its factorization.
11699669 is an evil number, because the sum of its binary digits is even.
The product of its digits is 157464, while the sum is 47.
The square root of 11699669 is about 3420.4778905878. The cubic root of 11699669 is about 227.0167272115.
The spelling of 11699669 in words is "eleven million, six hundred ninety-nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •