Base | Representation |
---|---|
bin | 1110001101000000010111… |
… | …11010010011100000010100 |
3 | 11002120212100112211201222112 |
4 | 13012200023322103200110 |
5 | 13043211044203311012 |
6 | 150232200202050152 |
7 | 6402344601462503 |
oct | 706401372234024 |
9 | 132525315751875 |
10 | 31233202010132 |
11 | 9a51a21317841 |
12 | 36052541a9958 |
13 | 14573805b27a5 |
14 | 79d9a32ac83a |
15 | 3926a9787122 |
hex | 1c680be93814 |
31233202010132 has 12 divisors (see below), whose sum is σ = 54690274279200. Its totient is φ = 15607409358936.
The previous prime is 31233202010111. The next prime is 31233202010137. The reversal of 31233202010132 is 23101020233213.
It is a junction number, because it is equal to n+sod(n) for n = 31233202010098 and 31233202010107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31233202010137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2297903888 + ... + 2297917479.
It is an arithmetic number, because the mean of its divisors is an integer number (4557522856600).
Almost surely, 231233202010132 is an apocalyptic number.
It is an amenable number.
31233202010132 is a deficient number, since it is larger than the sum of its proper divisors (23457072269068).
31233202010132 is a wasteful number, since it uses less digits than its factorization.
31233202010132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4595823070 (or 4595823068 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 31233202010132 its reverse (23101020233213), we get a palindrome (54334222243345).
The spelling of 31233202010132 in words is "thirty-one trillion, two hundred thirty-three billion, two hundred two million, ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •