Base | Representation |
---|---|
bin | 11100000000110101110110… |
… | …111110100100100110110001 |
3 | 121011020002211011121220002012 |
4 | 130000311312332210212301 |
5 | 112122030004022000423 |
6 | 1114010423221332305 |
7 | 34644063326355335 |
oct | 3400656676444661 |
9 | 534202734556065 |
10 | 123203133000113 |
11 | 36290178752481 |
12 | 11999713b67095 |
13 | 539900c38945a |
14 | 225d0c61917c5 |
15 | e39be23d5078 |
hex | 700d76fa49b1 |
123203133000113 has 2 divisors, whose sum is σ = 123203133000114. Its totient is φ = 123203133000112.
The previous prime is 123203133000107. The next prime is 123203133000149. The reversal of 123203133000113 is 311000331302321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109321495198864 + 13881637801249 = 10455692^2 + 3725807^2 .
It is a cyclic number.
It is not a de Polignac number, because 123203133000113 - 26 = 123203133000049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (123203133000163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61601566500056 + 61601566500057.
It is an arithmetic number, because the mean of its divisors is an integer number (61601566500057).
Almost surely, 2123203133000113 is an apocalyptic number.
It is an amenable number.
123203133000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
123203133000113 is an equidigital number, since it uses as much as digits as its factorization.
123203133000113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 123203133000113 its reverse (311000331302321), we get a palindrome (434203464302434).
The spelling of 123203133000113 in words is "one hundred twenty-three trillion, two hundred three billion, one hundred thirty-three million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •