Base | Representation |
---|---|
bin | 11100000000110111001110… |
… | …100010110010010001010001 |
3 | 121011020020121120000110102122 |
4 | 130000313032202302101101 |
5 | 112122041011120023212 |
6 | 1114011225101424025 |
7 | 34644144615532535 |
oct | 3400671642622121 |
9 | 534206546013378 |
10 | 123204602111057 |
11 | 36290861a55255 |
12 | 11999a63b6b015 |
13 | 53991b4854b7c |
14 | 225d1c5333bc5 |
15 | e39c7b37c272 |
hex | 700dce8b2451 |
123204602111057 has 2 divisors, whose sum is σ = 123204602111058. Its totient is φ = 123204602111056.
The previous prime is 123204602111029. The next prime is 123204602111069. The reversal of 123204602111057 is 750111206402321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72789717192721 + 50414884918336 = 8531689^2 + 7100344^2 .
It is an emirp because it is prime and its reverse (750111206402321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123204602111057 - 212 = 123204602106961 is a prime.
It is not a weakly prime, because it can be changed into another prime (123204607111057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61602301055528 + 61602301055529.
It is an arithmetic number, because the mean of its divisors is an integer number (61602301055529).
Almost surely, 2123204602111057 is an apocalyptic number.
It is an amenable number.
123204602111057 is a deficient number, since it is larger than the sum of its proper divisors (1).
123204602111057 is an equidigital number, since it uses as much as digits as its factorization.
123204602111057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20160, while the sum is 35.
Adding to 123204602111057 its reverse (750111206402321), we get a palindrome (873315808513378).
The spelling of 123204602111057 in words is "one hundred twenty-three trillion, two hundred four billion, six hundred two million, one hundred eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •