Base | Representation |
---|---|
bin | 1111000001000110010110… |
… | …10101100111001101100011 |
3 | 11022220222110000100100012211 |
4 | 13200203023111213031203 |
5 | 13312022322210342011 |
6 | 154122340100502551 |
7 | 6645561461454424 |
oct | 740431325471543 |
9 | 138828400310184 |
10 | 33023120012131 |
11 | a582032377077 |
12 | 38541280aaa57 |
13 | 15570b3b5a8b2 |
14 | 822482a9164b |
15 | 3c4019136b21 |
hex | 1e08cb567363 |
33023120012131 has 16 divisors (see below), whose sum is σ = 33503123681280. Its totient is φ = 32546311630560.
The previous prime is 33023120012111. The next prime is 33023120012143. The reversal of 33023120012131 is 13121002132033.
It is a cyclic number.
It is not a de Polignac number, because 33023120012131 - 221 = 33023117914979 is a prime.
It is a super-2 number, since 2×330231200121312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33023120012101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 397487326 + ... + 397570396.
It is an arithmetic number, because the mean of its divisors is an integer number (2093945230080).
Almost surely, 233023120012131 is an apocalyptic number.
33023120012131 is a deficient number, since it is larger than the sum of its proper divisors (480003669149).
33023120012131 is a wasteful number, since it uses less digits than its factorization.
33023120012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102234.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 33023120012131 its reverse (13121002132033), we get a palindrome (46144122144164).
The spelling of 33023120012131 in words is "thirty-three trillion, twenty-three billion, one hundred twenty million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •