Base | Representation |
---|---|
bin | 1101100100011010001… |
… | …1110011000001011101 |
3 | 211021200222101202001120 |
4 | 3121012203303001131 |
5 | 12304403134220013 |
6 | 255031251401153 |
7 | 22561506334413 |
oct | 3310643630135 |
9 | 737628352046 |
10 | 233112023133 |
11 | 8a953729280 |
12 | 392188b31b9 |
13 | 18ca035b982 |
14 | b3d59732b3 |
15 | 60e53be123 |
hex | 36468f305d |
233112023133 has 48 divisors (see below), whose sum is σ = 363758454720. Its totient is φ = 131652352000.
The previous prime is 233112023129. The next prime is 233112023143. The reversal of 233112023133 is 331320211332.
233112023133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 233112023133 - 22 = 233112023129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233112023143) 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 47 ways as a sum of consecutive naturals, for example, 842233 + ... + 1084241.
It is an arithmetic number, because the mean of its divisors is an integer number (7578301140).
Almost surely, 2233112023133 is an apocalyptic number.
It is an amenable number.
233112023133 is a deficient number, since it is larger than the sum of its proper divisors (130646431587).
233112023133 is a wasteful number, since it uses less digits than its factorization.
233112023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242158 (or 242141 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 233112023133 its reverse (331320211332), we get a palindrome (564432234465).
The spelling of 233112023133 in words is "two hundred thirty-three billion, one hundred twelve million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •