Base | Representation |
---|---|
bin | 111001011010101000… |
… | …0010000101101100101 |
3 | 102210020222202011012202 |
4 | 1302311100100231211 |
5 | 4010004301220031 |
6 | 132350535224245 |
7 | 11623326622061 |
oct | 1626520205545 |
9 | 383228664182 |
10 | 123300023141 |
11 | 48322715379 |
12 | 1ba90b18085 |
13 | b81caa7099 |
14 | 5d7972aaa1 |
15 | 3319a602cb |
hex | 1cb5410b65 |
123300023141 has 2 divisors, whose sum is σ = 123300023142. Its totient is φ = 123300023140.
The previous prime is 123300023107. The next prime is 123300023227. The reversal of 123300023141 is 141320003321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78654446116 + 44645577025 = 280454^2 + 211295^2 .
It is a cyclic number.
It is not a de Polignac number, because 123300023141 - 210 = 123300022117 is a prime.
It is a super-2 number, since 2×1233000231412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123300025141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61650011570 + 61650011571.
It is an arithmetic number, because the mean of its divisors is an integer number (61650011571).
Almost surely, 2123300023141 is an apocalyptic number.
It is an amenable number.
123300023141 is a deficient number, since it is larger than the sum of its proper divisors (1).
123300023141 is an equidigital number, since it uses as much as digits as its factorization.
123300023141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 123300023141 its reverse (141320003321), we get a palindrome (264620026462).
The spelling of 123300023141 in words is "one hundred twenty-three billion, three hundred million, twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •