Base | Representation |
---|---|
bin | 11011111110000011000111… |
… | …000100110111101111111111 |
3 | 121010112202102021000221021121 |
4 | 123332003013010313233333 |
5 | 112110403421021102401 |
6 | 1113342322222011411 |
7 | 34624160202005422 |
oct | 3376030704675777 |
9 | 533482367027247 |
10 | 123011203300351 |
11 | 362168384052a3 |
12 | 1196848b116b67 |
13 | 5383ba3025782 |
14 | 2253ab9c379b9 |
15 | e34c0c6e5ca1 |
hex | 6fe0c7137bff |
123011203300351 has 2 divisors, whose sum is σ = 123011203300352. Its totient is φ = 123011203300350.
The previous prime is 123011203300273. The next prime is 123011203300369. The reversal of 123011203300351 is 153003302110321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123011203300351 - 229 = 123010666429439 is a prime.
It is a super-2 number, since 2×1230112033003512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123011203300451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61505601650175 + 61505601650176.
It is an arithmetic number, because the mean of its divisors is an integer number (61505601650176).
Almost surely, 2123011203300351 is an apocalyptic number.
123011203300351 is a deficient number, since it is larger than the sum of its proper divisors (1).
123011203300351 is an equidigital number, since it uses as much as digits as its factorization.
123011203300351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 123011203300351 its reverse (153003302110321), we get a palindrome (276014505410672).
The spelling of 123011203300351 in words is "one hundred twenty-three trillion, eleven billion, two hundred three million, three hundred thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •