Base | Representation |
---|---|
bin | 1010111011001100010011… |
… | …1110101100101111010101 |
3 | 1120112100011020220121111021 |
4 | 2232303010332230233111 |
5 | 3033301121013031013 |
6 | 41314130230041141 |
7 | 2346561245434444 |
oct | 256630476545725 |
9 | 46470136817437 |
10 | 12012033330133 |
11 | 3911302730941 |
12 | 14200197a91b1 |
13 | 691964724085 |
14 | 2d7557bd4d5b |
15 | 15c6d9576a8d |
hex | aecc4facbd5 |
12012033330133 has 2 divisors, whose sum is σ = 12012033330134. Its totient is φ = 12012033330132.
The previous prime is 12012033330107. The next prime is 12012033330197. The reversal of 12012033330133 is 33103333021021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6090125681124 + 5921907649009 = 2467818^2 + 2433497^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12012033330133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12012033330098 and 12012033330107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12012033330103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006016665066 + 6006016665067.
It is an arithmetic number, because the mean of its divisors is an integer number (6006016665067).
Almost surely, 212012033330133 is an apocalyptic number.
It is an amenable number.
12012033330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012033330133 is an equidigital number, since it uses as much as digits as its factorization.
12012033330133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 12012033330133 its reverse (33103333021021), we get a palindrome (45115366351154).
The spelling of 12012033330133 in words is "twelve trillion, twelve billion, thirty-three million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •