Base | Representation |
---|---|
bin | 11100000010010011000100… |
… | …001010110011101110001101 |
3 | 121011120200010212111010222002 |
4 | 130002103010022303232031 |
5 | 112130144434322114242 |
6 | 1114124414100202045 |
7 | 34654235355366335 |
oct | 3402230412635615 |
9 | 534520125433862 |
10 | 123303212301197 |
11 | 36319664921665 |
12 | 119b4ba4399325 |
13 | 53a559b4430c6 |
14 | 2263c9b9760c5 |
15 | e3c5ed586432 |
hex | 7024c42b3b8d |
123303212301197 has 2 divisors, whose sum is σ = 123303212301198. Its totient is φ = 123303212301196.
The previous prime is 123303212301187. The next prime is 123303212301223. The reversal of 123303212301197 is 791103212303321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93273371258596 + 30029841042601 = 9657814^2 + 5479949^2 .
It is a cyclic number.
It is not a de Polignac number, because 123303212301197 - 210 = 123303212300173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123303212301197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123303212301187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61651606150598 + 61651606150599.
It is an arithmetic number, because the mean of its divisors is an integer number (61651606150599).
Almost surely, 2123303212301197 is an apocalyptic number.
It is an amenable number.
123303212301197 is a deficient number, since it is larger than the sum of its proper divisors (1).
123303212301197 is an equidigital number, since it uses as much as digits as its factorization.
123303212301197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 38.
The spelling of 123303212301197 in words is "one hundred twenty-three trillion, three hundred three billion, two hundred twelve million, three hundred one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •