Base | Representation |
---|---|
bin | 11101010001000110101… |
… | …001101100110110000001 |
3 | 21010021100002010112201210 |
4 | 131101012221230312001 |
5 | 230422444341444413 |
6 | 4135540223320333 |
7 | 265210104123633 |
oct | 35210651546601 |
9 | 7107302115653 |
10 | 2011230031233 |
11 | 705a59a13535 |
12 | 285958a500a9 |
13 | 11787302c277 |
14 | 6d4b611ca53 |
15 | 374b3d593c3 |
hex | 1d446a6cd81 |
2011230031233 has 4 divisors (see below), whose sum is σ = 2681640041648. Its totient is φ = 1340820020820.
The previous prime is 2011230031183. The next prime is 2011230031247. The reversal of 2011230031233 is 3321300321102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2011230031233 - 26 = 2011230031169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011230031273) 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 3 ways as a sum of consecutive naturals, for example, 335205005203 + ... + 335205005208.
It is an arithmetic number, because the mean of its divisors is an integer number (670410010412).
Almost surely, 22011230031233 is an apocalyptic number.
It is an amenable number.
2011230031233 is a deficient number, since it is larger than the sum of its proper divisors (670410010415).
2011230031233 is an equidigital number, since it uses as much as digits as its factorization.
2011230031233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670410010414.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2011230031233 its reverse (3321300321102), we get a palindrome (5332530352335).
The spelling of 2011230031233 in words is "two trillion, eleven billion, two hundred thirty million, thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •