Base | Representation |
---|---|
bin | 10111011111110… |
… | …11100010100111 |
3 | 111201220102121101 |
4 | 23233323202213 |
5 | 400430122043 |
6 | 31320500531 |
7 | 4612304311 |
oct | 1357734247 |
9 | 451812541 |
10 | 197114023 |
11 | a12a1757 |
12 | 5601a747 |
13 | 31ab6822 |
14 | 1c2707b1 |
15 | 1248924d |
hex | bbfb8a7 |
197114023 has 2 divisors, whose sum is σ = 197114024. Its totient is φ = 197114022.
The previous prime is 197114017. The next prime is 197114051. The reversal of 197114023 is 320411791.
It is an a-pointer prime, because the next prime (197114051) can be obtained adding 197114023 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-197114023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 197113982 and 197114000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (197114083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98557011 + 98557012.
It is an arithmetic number, because the mean of its divisors is an integer number (98557012).
Almost surely, 2197114023 is an apocalyptic number.
197114023 is a deficient number, since it is larger than the sum of its proper divisors (1).
197114023 is an equidigital number, since it uses as much as digits as its factorization.
197114023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 197114023 is about 14039.7301612246. The cubic root of 197114023 is about 581.9770256201.
The spelling of 197114023 in words is "one hundred ninety-seven million, one hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •