Base | Representation |
---|---|
bin | 101000101100… |
… | …111000011101 |
3 | 202002001221021 |
4 | 220230320131 |
5 | 10212411342 |
6 | 1020404141 |
7 | 156455461 |
oct | 50547035 |
9 | 22061837 |
10 | 10669597 |
11 | 6028254 |
12 | 36a6651 |
13 | 2297593 |
14 | 15ba4a1 |
15 | e0b567 |
hex | a2ce1d |
10669597 has 2 divisors, whose sum is σ = 10669598. Its totient is φ = 10669596.
The previous prime is 10669577. The next prime is 10669609. The reversal of 10669597 is 79596601.
10669597 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., 6625476 + 4044121 = 2574^2 + 2011^2 .
It is a cyclic number.
It is not a de Polignac number, because 10669597 - 211 = 10667549 is a prime.
It is a super-2 number, since 2×106695972 = 227680600284818, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10669537) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5334798 + 5334799.
It is an arithmetic number, because the mean of its divisors is an integer number (5334799).
Almost surely, 210669597 is an apocalyptic number.
It is an amenable number.
10669597 is a deficient number, since it is larger than the sum of its proper divisors (1).
10669597 is an equidigital number, since it uses as much as digits as its factorization.
10669597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 102060, while the sum is 43.
The square root of 10669597 is about 3266.4349067447. The cubic root of 10669597 is about 220.1486392213.
It can be divided in two parts, 10 and 669597, that multiplied together give a triangular number (6695970 = T3659).
The spelling of 10669597 in words is "ten million, six hundred sixty-nine thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •