Base | Representation |
---|---|
bin | 1101100001000001010… |
… | …1011111001001010001 |
3 | 211012100120121010022111 |
4 | 3120100111133021101 |
5 | 12301022242131113 |
6 | 254401113105321 |
7 | 22530122000332 |
oct | 3302025371121 |
9 | 735316533274 |
10 | 232202302033 |
11 | 8a527167359 |
12 | 390040b8241 |
13 | 18b86a40670 |
14 | b34ac06289 |
15 | 60905c213d |
hex | 361055f251 |
232202302033 has 8 divisors (see below), whose sum is σ = 250255949888. Its totient is φ = 214176073104.
The previous prime is 232202302019. The next prime is 232202302043. The reversal of 232202302033 is 330203202232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232202302033 - 229 = 231665431121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232202301995 and 232202302013.
It is not an unprimeable number, because it can be changed into a prime (232202302043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6837135 + ... + 6871012.
It is an arithmetic number, because the mean of its divisors is an integer number (31281993736).
Almost surely, 2232202302033 is an apocalyptic number.
It is an amenable number.
232202302033 is a deficient number, since it is larger than the sum of its proper divisors (18053647855).
232202302033 is a wasteful number, since it uses less digits than its factorization.
232202302033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13709463.
The product of its (nonzero) digits is 2592, while the sum is 22.
Adding to 232202302033 its reverse (330203202232), we get a palindrome (562405504265).
The spelling of 232202302033 in words is "two hundred thirty-two billion, two hundred two million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •