Base | Representation |
---|---|
bin | 111001011000100110… |
… | …0110111010000000101 |
3 | 102210002020210102022122 |
4 | 1302301030313100011 |
5 | 4004334344223212 |
6 | 132340105535325 |
7 | 11621542626416 |
oct | 1626114672005 |
9 | 383066712278 |
10 | 123232023557 |
11 | 482982a0275 |
12 | 1ba721a4545 |
13 | b80b988c46 |
14 | 5d706a980d |
15 | 3313acc272 |
hex | 1cb1337405 |
123232023557 has 2 divisors, whose sum is σ = 123232023558. Its totient is φ = 123232023556.
The previous prime is 123232023521. The next prime is 123232023581. The reversal of 123232023557 is 755320232321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111191570116 + 12040453441 = 333454^2 + 109729^2 .
It is a cyclic number.
It is not a de Polignac number, because 123232023557 - 26 = 123232023493 is a prime.
It is a super-2 number, since 2×1232320235572 (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 (123232073557) 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, 61616011778 + 61616011779.
It is an arithmetic number, because the mean of its divisors is an integer number (61616011779).
Almost surely, 2123232023557 is an apocalyptic number.
It is an amenable number.
123232023557 is a deficient number, since it is larger than the sum of its proper divisors (1).
123232023557 is an equidigital number, since it uses as much as digits as its factorization.
123232023557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 35.
Adding to 123232023557 its reverse (755320232321), we get a palindrome (878552255878).
The spelling of 123232023557 in words is "one hundred twenty-three billion, two hundred thirty-two million, twenty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •