Base | Representation |
---|---|
bin | 1010111011001001001101… |
… | …1000100000000011101101 |
3 | 1120112021000021011200222212 |
4 | 2232302103120200003231 |
5 | 3033242420003430013 |
6 | 41313511503220205 |
7 | 2346531522636614 |
oct | 256622330400355 |
9 | 46467007150885 |
10 | 12011201233133 |
11 | 3910a15a68073 |
12 | 141ba26ba7665 |
13 | 69186121389b |
14 | 2d74b94b287b |
15 | 15c68b4ae6a8 |
hex | aec936200ed |
12011201233133 has 16 divisors (see below), whose sum is σ = 12772113716736. Its totient is φ = 11270254195200.
The previous prime is 12011201233123. The next prime is 12011201233139. The reversal of 12011201233133 is 33133210211021.
It is a cyclic number.
It is not a de Polignac number, because 12011201233133 - 240 = 10911689605357 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 12011201233099 and 12011201233108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011201233139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6230333 + ... + 7927133.
It is an arithmetic number, because the mean of its divisors is an integer number (798257107296).
Almost surely, 212011201233133 is an apocalyptic number.
It is an amenable number.
12011201233133 is a deficient number, since it is larger than the sum of its proper divisors (760912483603).
12011201233133 is a wasteful number, since it uses less digits than its factorization.
12011201233133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1702684.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12011201233133 its reverse (33133210211021), we get a palindrome (45144411444154).
The spelling of 12011201233133 in words is "twelve trillion, eleven billion, two hundred one million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •