Base | Representation |
---|---|
bin | 1101100100110110101… |
… | …0100000100101011101 |
3 | 211022000021200201201101 |
4 | 3121031222200211131 |
5 | 12310124143120013 |
6 | 255051150313101 |
7 | 22564454454316 |
oct | 3311552404535 |
9 | 738007621641 |
10 | 233231223133 |
11 | 8aa04a43a77 |
12 | 392507b8791 |
13 | 18cbbc6570c |
14 | b40772160d |
15 | 6100ab78dd |
hex | 364daa095d |
233231223133 has 16 divisors (see below), whose sum is σ = 242426511360. Its totient is φ = 224143830000.
The previous prime is 233231223073. The next prime is 233231223139. The reversal of 233231223133 is 331322132332.
233231223133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 233231223133 - 213 = 233231214941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233231223139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4139316 + ... + 4195282.
It is an arithmetic number, because the mean of its divisors is an integer number (15151656960).
Almost surely, 2233231223133 is an apocalyptic number.
It is an amenable number.
233231223133 is a deficient number, since it is larger than the sum of its proper divisors (9195288227).
233231223133 is a wasteful number, since it uses less digits than its factorization.
233231223133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56928.
The product of its digits is 11664, while the sum is 28.
Adding to 233231223133 its reverse (331322132332), we get a palindrome (564553355465).
The spelling of 233231223133 in words is "two hundred thirty-three billion, two hundred thirty-one million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •