Base | Representation |
---|---|
bin | 11011111111101000011101… |
… | …101110110000001000110101 |
3 | 121010221011022200010020102122 |
4 | 123333220131232300020311 |
5 | 112114144311003132242 |
6 | 1113504321143445325 |
7 | 34635062102524556 |
oct | 3377503556601065 |
9 | 533834280106378 |
10 | 123120031302197 |
11 | 36258a03a34896 |
12 | 119855a1456845 |
13 | 5391227783837 |
14 | 22590814da32d |
15 | e3797b984ad2 |
hex | 6ffa1dbb0235 |
123120031302197 has 2 divisors, whose sum is σ = 123120031302198. Its totient is φ = 123120031302196.
The previous prime is 123120031302179. The next prime is 123120031302241. The reversal of 123120031302197 is 791203130021321.
Together with previous prime (123120031302179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85183190316676 + 37936840985521 = 9229474^2 + 6159289^2 .
It is a cyclic number.
It is not a de Polignac number, because 123120031302197 - 222 = 123120027107893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123120031302397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61560015651098 + 61560015651099.
It is an arithmetic number, because the mean of its divisors is an integer number (61560015651099).
Almost surely, 2123120031302197 is an apocalyptic number.
It is an amenable number.
123120031302197 is a deficient number, since it is larger than the sum of its proper divisors (1).
123120031302197 is an equidigital number, since it uses as much as digits as its factorization.
123120031302197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 123120031302197 in words is "one hundred twenty-three trillion, one hundred twenty billion, thirty-one million, three hundred two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •