Base | Representation |
---|---|
bin | 1101100001011001000… |
… | …1110110001010011001 |
3 | 211012121112012212100102 |
4 | 3120112101312022121 |
5 | 12301223303323113 |
6 | 254415034145145 |
7 | 22532442341201 |
oct | 3302621661231 |
9 | 735545185312 |
10 | 232302011033 |
11 | 8a57847a194 |
12 | 390315821b5 |
13 | 18ba15b1881 |
14 | b35a15d401 |
15 | 609921a758 |
hex | 3616476299 |
232302011033 has 8 divisors (see below), whose sum is σ = 232874287848. Its totient is φ = 231730369024.
The previous prime is 232302011023. The next prime is 232302011159. The reversal of 232302011033 is 330110203232.
It can be written as a sum of positive squares in 4 ways, for example, as 14798235904 + 217503775129 = 121648^2 + 466373^2 .
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 232302011033 - 28 = 232302010777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232302010996 and 232302011014.
It is not an unprimeable number, because it can be changed into a prime (232302011003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 578285 + ... + 893877.
It is an arithmetic number, because the mean of its divisors is an integer number (29109285981).
Almost surely, 2232302011033 is an apocalyptic number.
It is an amenable number.
232302011033 is a deficient number, since it is larger than the sum of its proper divisors (572276815).
232302011033 is a wasteful number, since it uses less digits than its factorization.
232302011033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317403.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 232302011033 its reverse (330110203232), we get a palindrome (562412214265).
The spelling of 232302011033 in words is "two hundred thirty-two billion, three hundred two million, eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.329 sec. • engine limits •