Base | Representation |
---|---|
bin | 1110101111100… |
… | …00111101111101 |
3 | 22121201002220002 |
4 | 13113300331331 |
5 | 223124423042 |
6 | 20134404045 |
7 | 3031116044 |
oct | 727607575 |
9 | 277632802 |
10 | 123670397 |
11 | 63899444 |
12 | 35500625 |
13 | 1c810766 |
14 | 125d355b |
15 | accd132 |
hex | 75f0f7d |
123670397 has 2 divisors, whose sum is σ = 123670398. Its totient is φ = 123670396.
The previous prime is 123670381. The next prime is 123670433. The reversal of 123670397 is 793076321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81342361 + 42328036 = 9019^2 + 6506^2 .
It is a cyclic number.
It is not a de Polignac number, because 123670397 - 24 = 123670381 is a prime.
It is a Chen prime.
It is equal to p7038695 and since 123670397 and 7038695 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123670397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123670307) 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, 61835198 + 61835199.
It is an arithmetic number, because the mean of its divisors is an integer number (61835199).
Almost surely, 2123670397 is an apocalyptic number.
It is an amenable number.
123670397 is a deficient number, since it is larger than the sum of its proper divisors (1).
123670397 is an equidigital number, since it uses as much as digits as its factorization.
123670397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47628, while the sum is 38.
The square root of 123670397 is about 11120.7192663065. The cubic root of 123670397 is about 498.2208729223.
The spelling of 123670397 in words is "one hundred twenty-three million, six hundred seventy thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •