Base | Representation |
---|---|
bin | 11101010010001000011… |
… | …110101010001101101101 |
3 | 21010101012001020222022212 |
4 | 131102020132222031231 |
5 | 230432230103330013 |
6 | 4140241554420205 |
7 | 265246344312353 |
oct | 35221036521555 |
9 | 7111161228285 |
10 | 2012334433133 |
11 | 706476364a82 |
12 | 286006891665 |
13 | 1179baa9170b |
14 | 6d57ca857d3 |
15 | 3752acae6a8 |
hex | 1d4887aa36d |
2012334433133 has 2 divisors, whose sum is σ = 2012334433134. Its totient is φ = 2012334433132.
The previous prime is 2012334433129. The next prime is 2012334433147. The reversal of 2012334433133 is 3313344332102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1834147450249 + 178186982884 = 1354307^2 + 422122^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012334433133 - 22 = 2012334433129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2012334433133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012334453133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006167216566 + 1006167216567.
It is an arithmetic number, because the mean of its divisors is an integer number (1006167216567).
Almost surely, 22012334433133 is an apocalyptic number.
It is an amenable number.
2012334433133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012334433133 is an equidigital number, since it uses as much as digits as its factorization.
2012334433133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 2012334433133 its reverse (3313344332102), we get a palindrome (5325678765235).
The spelling of 2012334433133 in words is "two trillion, twelve billion, three hundred thirty-four million, four hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •