Base | Representation |
---|---|
bin | 11101010010000000100… |
… | …010110101101110011101 |
3 | 21010100211202202200021102 |
4 | 131102000202311232131 |
5 | 230431442013424013 |
6 | 4140220441242445 |
7 | 265243136636516 |
oct | 35220042655635 |
9 | 7110752680242 |
10 | 2012201311133 |
11 | 7064082004a2 |
12 | 285b8a193425 |
13 | 117999321bc0 |
14 | 6d569111a0d |
15 | 3751e265d58 |
hex | 1d4808b5b9d |
2012201311133 has 4 divisors (see below), whose sum is σ = 2166986027388. Its totient is φ = 1857416594880.
The previous prime is 2012201311129. The next prime is 2012201311139. The reversal of 2012201311133 is 3311131022102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1101697945924 + 910503365209 = 1049618^2 + 954203^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012201311133 - 22 = 2012201311129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012201311139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77392358108 + ... + 77392358133.
It is an arithmetic number, because the mean of its divisors is an integer number (541746506847).
Almost surely, 22012201311133 is an apocalyptic number.
It is an amenable number.
2012201311133 is a deficient number, since it is larger than the sum of its proper divisors (154784716255).
2012201311133 is a wasteful number, since it uses less digits than its factorization.
2012201311133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154784716254.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2012201311133 its reverse (3311131022102), we get a palindrome (5323332333235).
The spelling of 2012201311133 in words is "two trillion, twelve billion, two hundred one million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •