Base | Representation |
---|---|
bin | 11101100101100000001… |
… | …010111011110100110111 |
3 | 21012100212112110011102011 |
4 | 131211200022323310313 |
5 | 231302324022311411 |
6 | 4154001452225051 |
7 | 266613634305361 |
oct | 35454012736467 |
9 | 7170775404364 |
10 | 2033133010231 |
11 | 714279642874 |
12 | 28a05016b187 |
13 | 119953a4167b |
14 | 70593045d31 |
15 | 37d46bc0c21 |
hex | 1d9602bbd37 |
2033133010231 has 6 divisors (see below), whose sum is σ = 2059194647832. Its totient is φ = 2007397143180.
The previous prime is 2033133010189. The next prime is 2033133010253. The reversal of 2033133010231 is 1320103313302.
It is not a de Polignac number, because 2033133010231 - 213 = 2033133002039 is a prime.
It is a super-2 number, since 2×20331330102312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2033133010261) 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 5 ways as a sum of consecutive naturals, for example, 162878955 + ... + 162891436.
It is an arithmetic number, because the mean of its divisors is an integer number (343199107972).
Almost surely, 22033133010231 is an apocalyptic number.
2033133010231 is a deficient number, since it is larger than the sum of its proper divisors (26061637601).
2033133010231 is an frugal number, since it uses more digits than its factorization.
2033133010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325770549 (or 325770470 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2033133010231 its reverse (1320103313302), we get a palindrome (3353236323533).
The spelling of 2033133010231 in words is "two trillion, thirty-three billion, one hundred thirty-three million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •