Base | Representation |
---|---|
bin | 110100110011011011110101… |
… | …011110001000000111011011 |
3 | 1010110021020222001210120020010 |
4 | 310303123311132020013123 |
5 | 220414401141000311303 |
6 | 2141530211204333003 |
7 | 66626165142642303 |
oct | 6463336536100733 |
9 | 1113236861716203 |
10 | 232233000010203 |
11 | 67aa650a227495 |
12 | 220683899a4163 |
13 | 9c7762a0327ca |
14 | 414c1cc596603 |
15 | 1bcada748ac03 |
hex | d336f57881db |
232233000010203 has 8 divisors (see below), whose sum is σ = 314720131161616. Its totient is φ = 152283934432800.
The previous prime is 232233000010159. The next prime is 232233000010217. The reversal of 232233000010203 is 302010000332232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 232233000010203 - 216 = 232232999944667 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232233000010203.
It is not an unprimeable number, because it can be changed into a prime (232233000010223) 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, 634516393288 + ... + 634516393653.
It is an arithmetic number, because the mean of its divisors is an integer number (39340016395202).
Almost surely, 2232233000010203 is an apocalyptic number.
232233000010203 is a deficient number, since it is larger than the sum of its proper divisors (82487131151413).
232233000010203 is a wasteful number, since it uses less digits than its factorization.
232233000010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1269032787005.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 232233000010203 its reverse (302010000332232), we get a palindrome (534243000342435).
The spelling of 232233000010203 in words is "two hundred thirty-two trillion, two hundred thirty-three billion, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •