Base | Representation |
---|---|
bin | 101100100100… |
… | …0101000110101 |
3 | 1121222010101201 |
4 | 1121020220311 |
5 | 21440204242 |
6 | 2152452501 |
7 | 402416011 |
oct | 131105065 |
9 | 47863351 |
10 | 23366197 |
11 | 1220a408 |
12 | 79aa131 |
13 | 4ac166a |
14 | 3163541 |
15 | 20b84b7 |
hex | 1648a35 |
23366197 has 2 divisors, whose sum is σ = 23366198. Its totient is φ = 23366196.
The previous prime is 23366179. The next prime is 23366207. The reversal of 23366197 is 79166332.
Together with previous prime (23366179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21911761 + 1454436 = 4681^2 + 1206^2 .
It is a cyclic number.
It is not a de Polignac number, because 23366197 - 27 = 23366069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23366107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11683098 + 11683099.
It is an arithmetic number, because the mean of its divisors is an integer number (11683099).
Almost surely, 223366197 is an apocalyptic number.
It is an amenable number.
23366197 is a deficient number, since it is larger than the sum of its proper divisors (1).
23366197 is an equidigital number, since it uses as much as digits as its factorization.
23366197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40824, while the sum is 37.
The square root of 23366197 is about 4833.8594311378. The cubic root of 23366197 is about 285.8880558519. Note that the first 3 decimals are identical.
It can be divided in two parts, 233 and 66197, that added together give a triangular number (66430 = T364).
The spelling of 23366197 in words is "twenty-three million, three hundred sixty-six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •