Base | Representation |
---|---|
bin | 1101100100011010010… |
… | …0000110010010000101 |
3 | 211021200222112202021100 |
4 | 3121012210012102011 |
5 | 12304403144231041 |
6 | 255031253210313 |
7 | 22561510113411 |
oct | 3310644062205 |
9 | 737628482240 |
10 | 233112102021 |
11 | 8a953782577 |
12 | 39218930999 |
13 | 18ca0388856 |
14 | b3d5993d41 |
15 | 60e53d76b6 |
hex | 3646906485 |
233112102021 has 6 divisors (see below), whose sum is σ = 336717480710. Its totient is φ = 155408068008.
The previous prime is 233112102017. The next prime is 233112102023. The reversal of 233112102021 is 120201211332.
It can be written as a sum of positive squares in only one way, i.e., 152591796900 + 80520305121 = 390630^2 + 283761^2 .
It is not a de Polignac number, because 233112102021 - 22 = 233112102017 is a prime.
It is a super-2 number, since 2×2331121020212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233112101985 and 233112102003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233112102023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12950672326 + ... + 12950672343.
Almost surely, 2233112102021 is an apocalyptic number.
It is an amenable number.
233112102021 is a deficient number, since it is larger than the sum of its proper divisors (103605378689).
233112102021 is a wasteful number, since it uses less digits than its factorization.
233112102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25901344675 (or 25901344672 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 233112102021 its reverse (120201211332), we get a palindrome (353313313353).
The spelling of 233112102021 in words is "two hundred thirty-three billion, one hundred twelve million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •