Base | Representation |
---|---|
bin | 11101010001000111011… |
… | …100110001101001001001 |
3 | 21010021101000022202222200 |
4 | 131101013130301221021 |
5 | 230423011303421413 |
6 | 4135541422310413 |
7 | 265210325666625 |
oct | 35210734615111 |
9 | 7107330282880 |
10 | 2011243420233 |
11 | 705a66528923 |
12 | 285961428409 |
13 | 117875a39558 |
14 | 6d4b7c06185 |
15 | 374b5101573 |
hex | 1d447731a49 |
2011243420233 has 24 divisors (see below), whose sum is σ = 2975440366080. Its totient is φ = 1308642635040.
The previous prime is 2011243420189. The next prime is 2011243420267. The reversal of 2011243420233 is 3320243421102.
2011243420233 is a `hidden beast` number, since 2 + 0 + 1 + 1 + 2 + 4 + 3 + 420 + 233 = 666.
It is not a de Polignac number, because 2011243420233 - 221 = 2011241323081 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2011243420197 and 2011243420206.
It is not an unprimeable number, because it can be changed into a prime (2011243420273) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10946703 + ... + 11128916.
It is an arithmetic number, because the mean of its divisors is an integer number (123976681920).
Almost surely, 22011243420233 is an apocalyptic number.
It is an amenable number.
2011243420233 is a deficient number, since it is larger than the sum of its proper divisors (964196945847).
2011243420233 is a wasteful number, since it uses less digits than its factorization.
2011243420233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22075869 (or 22075866 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 2011243420233 its reverse (3320243421102), we get a palindrome (5331486841335).
The spelling of 2011243420233 in words is "two trillion, eleven billion, two hundred forty-three million, four hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •