Base | Representation |
---|---|
bin | 110100110001110010101100… |
… | …111000011110111101000111 |
3 | 1010102212110120210000221200121 |
4 | 310301302230320132331013 |
5 | 220411023442414024111 |
6 | 2141402301404522411 |
7 | 66615060534320626 |
oct | 6461625470367507 |
9 | 1112773523027617 |
10 | 232120113033031 |
11 | 67a626504a2733 |
12 | 2204a524250407 |
13 | 9c69aa96a45b2 |
14 | 414695dbcb6bd |
15 | 1bc7e9bbc7871 |
hex | d31cace1ef47 |
232120113033031 has 2 divisors, whose sum is σ = 232120113033032. Its totient is φ = 232120113033030.
The previous prime is 232120113033023. The next prime is 232120113033143. The reversal of 232120113033031 is 130330311021232.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232120113033031 - 23 = 232120113033023 is a prime.
It is a super-2 number, since 2×2321201130330312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232120113032987 and 232120113033005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232120113033331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116060056516515 + 116060056516516.
It is an arithmetic number, because the mean of its divisors is an integer number (116060056516516).
Almost surely, 2232120113033031 is an apocalyptic number.
232120113033031 is a deficient number, since it is larger than the sum of its proper divisors (1).
232120113033031 is an equidigital number, since it uses as much as digits as its factorization.
232120113033031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 232120113033031 its reverse (130330311021232), we get a palindrome (362450424054263).
The spelling of 232120113033031 in words is "two hundred thirty-two trillion, one hundred twenty billion, one hundred thirteen million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •