Base | Representation |
---|---|
bin | 1010111010100011100111… |
… | …1111101011111000001101 |
3 | 1120111021222002210022022112 |
4 | 2232220321333223320031 |
5 | 3033111234033334013 |
6 | 41305122355553405 |
7 | 2346023506436315 |
oct | 256507177537015 |
9 | 46437862708275 |
10 | 12001111621133 |
11 | 3907708707258 |
12 | 1419a8bbbb865 |
13 | 690913aabc7b |
14 | 2d6bdd4a4445 |
15 | 15c29a7eeba8 |
hex | aea39febe0d |
12001111621133 has 2 divisors, whose sum is σ = 12001111621134. Its totient is φ = 12001111621132.
The previous prime is 12001111621091. The next prime is 12001111621201. The reversal of 12001111621133 is 33112611110021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6951464452969 + 5049647168164 = 2636563^2 + 2247142^2 .
It is a cyclic number.
It is not a de Polignac number, because 12001111621133 - 218 = 12001111358989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12001111621099 and 12001111621108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001111821133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000555810566 + 6000555810567.
It is an arithmetic number, because the mean of its divisors is an integer number (6000555810567).
Almost surely, 212001111621133 is an apocalyptic number.
It is an amenable number.
12001111621133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001111621133 is an equidigital number, since it uses as much as digits as its factorization.
12001111621133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 12001111621133 its reverse (33112611110021), we get a palindrome (45113722731154).
The spelling of 12001111621133 in words is "twelve trillion, one billion, one hundred eleven million, six hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •