Base | Representation |
---|---|
bin | 11100000010101110001010… |
… | …110101100011111001101011 |
3 | 121011200110021002201122101211 |
4 | 130002232022311203321223 |
5 | 112131134040142414011 |
6 | 1114150030004253551 |
7 | 34656315513065161 |
oct | 3402561265437153 |
9 | 534613232648354 |
10 | 123332315201131 |
11 | 3632aa39734083 |
12 | 119ba7669a12b7 |
13 | 53a82589b875a |
14 | 226545cbbb231 |
15 | e3d253557b21 |
hex | 702b8ad63e6b |
123332315201131 has 2 divisors, whose sum is σ = 123332315201132. Its totient is φ = 123332315201130.
The previous prime is 123332315201107. The next prime is 123332315201171. The reversal of 123332315201131 is 131102513233321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 123332315201131 - 225 = 123332281646699 is a prime.
It is a super-2 number, since 2×1233323152011312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123332315201093 and 123332315201102.
It is not a weakly prime, because it can be changed into another prime (123332315201171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61666157600565 + 61666157600566.
It is an arithmetic number, because the mean of its divisors is an integer number (61666157600566).
Almost surely, 2123332315201131 is an apocalyptic number.
123332315201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123332315201131 is an equidigital number, since it uses as much as digits as its factorization.
123332315201131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 123332315201131 its reverse (131102513233321), we get a palindrome (254434828434452).
The spelling of 123332315201131 in words is "one hundred twenty-three trillion, three hundred thirty-two billion, three hundred fifteen million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •