Base | Representation |
---|---|
bin | 1010111011001000100000… |
… | …0110101011010001111101 |
3 | 1120112020112002010020012122 |
4 | 2232302020012223101331 |
5 | 3033242023033324013 |
6 | 41313441023412325 |
7 | 2346524034402152 |
oct | 256621006532175 |
9 | 46466462106178 |
10 | 12011012011133 |
11 | 3910929176853 |
12 | 141b9937540a5 |
13 | 691830c612c5 |
14 | 2d749c2d8229 |
15 | 15c679a83a08 |
hex | aec881ab47d |
12011012011133 has 2 divisors, whose sum is σ = 12011012011134. Its totient is φ = 12011012011132.
The previous prime is 12011012011111. The next prime is 12011012011153. The reversal of 12011012011133 is 33111021011021.
12011012011133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9659334554809 + 2351677456324 = 3107947^2 + 1533518^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12011012011133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011012011153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005506005566 + 6005506005567.
It is an arithmetic number, because the mean of its divisors is an integer number (6005506005567).
Almost surely, 212011012011133 is an apocalyptic number.
It is an amenable number.
12011012011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011012011133 is an equidigital number, since it uses as much as digits as its factorization.
12011012011133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 12011012011133 its reverse (33111021011021), we get a palindrome (45122033022154).
The spelling of 12011012011133 in words is "twelve trillion, eleven billion, twelve million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •