Base | Representation |
---|---|
bin | 1010111011001001101100… |
… | …0100111001101110101011 |
3 | 1120112021100021001122110112 |
4 | 2232302123010321232223 |
5 | 3033243201030010011 |
6 | 41313532354004535 |
7 | 2346534651046262 |
oct | 256623304715653 |
9 | 46467307048415 |
10 | 12011330313131 |
11 | 3910a81910856 |
12 | 141ba6227674b |
13 | 691881b99696 |
14 | 2d74cc6b35d9 |
15 | 15c6979aa58b |
hex | aec9b139bab |
12011330313131 has 2 divisors, whose sum is σ = 12011330313132. Its totient is φ = 12011330313130.
The previous prime is 12011330313079. The next prime is 12011330313139. The reversal of 12011330313131 is 13131303311021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12011330313131 is a prime.
It is a super-4 number, since 4×120113303131314 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 12011330313097 and 12011330313106.
It is not a weakly prime, because it can be changed into another prime (12011330313139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005665156565 + 6005665156566.
It is an arithmetic number, because the mean of its divisors is an integer number (6005665156566).
Almost surely, 212011330313131 is an apocalyptic number.
12011330313131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011330313131 is an equidigital number, since it uses as much as digits as its factorization.
12011330313131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 12011330313131 its reverse (13131303311021), we get a palindrome (25142633624152).
The spelling of 12011330313131 in words is "twelve trillion, eleven billion, three hundred thirty million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •