Base | Representation |
---|---|
bin | 111001010111101011… |
… | …1101010011010011111 |
3 | 102210000002222111200211 |
4 | 1302233113222122133 |
5 | 4004304013101002 |
6 | 132333051233251 |
7 | 11621020525633 |
oct | 1625727523237 |
9 | 383002874624 |
10 | 123201300127 |
11 | 48281a16304 |
12 | 1ba63a48827 |
13 | b8054bc8b9 |
14 | 5d6a58cdc3 |
15 | 331105ddd7 |
hex | 1caf5ea69f |
123201300127 has 2 divisors, whose sum is σ = 123201300128. Its totient is φ = 123201300126.
The previous prime is 123201300121. The next prime is 123201300133. The reversal of 123201300127 is 721003102321.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (123201300121) and next prime (123201300133).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123201300127 is a prime.
It is a super-2 number, since 2×1232013001272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123201300098 and 123201300107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123201300121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61600650063 + 61600650064.
It is an arithmetic number, because the mean of its divisors is an integer number (61600650064).
Almost surely, 2123201300127 is an apocalyptic number.
123201300127 is a deficient number, since it is larger than the sum of its proper divisors (1).
123201300127 is an equidigital number, since it uses as much as digits as its factorization.
123201300127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 123201300127 its reverse (721003102321), we get a palindrome (844204402448).
The spelling of 123201300127 in words is "one hundred twenty-three billion, two hundred one million, three hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •