Base | Representation |
---|---|
bin | 111001010111111110… |
… | …1000010111110010101 |
3 | 102210000210102101200001 |
4 | 1302233331002332111 |
5 | 4004314020200203 |
6 | 132334041251301 |
7 | 11621200033066 |
oct | 1625775027625 |
9 | 383023371601 |
10 | 123211100053 |
11 | 482874aa118 |
12 | 1ba67193b31 |
13 | b807541382 |
14 | 5d6b9c056d |
15 | 3311d4791d |
hex | 1caff42f95 |
123211100053 has 2 divisors, whose sum is σ = 123211100054. Its totient is φ = 123211100052.
The previous prime is 123211099987. The next prime is 123211100057. The reversal of 123211100053 is 350001112321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77405255524 + 45805844529 = 278218^2 + 214023^2 .
It is a cyclic number.
It is not a de Polignac number, because 123211100053 - 221 = 123209002901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123211100053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123211100057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61605550026 + 61605550027.
It is an arithmetic number, because the mean of its divisors is an integer number (61605550027).
Almost surely, 2123211100053 is an apocalyptic number.
It is an amenable number.
123211100053 is a deficient number, since it is larger than the sum of its proper divisors (1).
123211100053 is an equidigital number, since it uses as much as digits as its factorization.
123211100053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
Adding to 123211100053 its reverse (350001112321), we get a palindrome (473212212374).
The spelling of 123211100053 in words is "one hundred twenty-three billion, two hundred eleven million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •