Base | Representation |
---|---|
bin | 10001100111110111001… |
… | …100110101111111111001 |
3 | 11021202212222112011200122 |
4 | 101213313030311333321 |
5 | 124320143441240213 |
6 | 2324201351143025 |
7 | 153331346632322 |
oct | 21476714657771 |
9 | 4252788464618 |
10 | 1211033149433 |
11 | 427661706608 |
12 | 176858674a75 |
13 | 8a27a34a9b3 |
14 | 42885987449 |
15 | 2177d626d08 |
hex | 119f7335ff9 |
1211033149433 has 2 divisors, whose sum is σ = 1211033149434. Its totient is φ = 1211033149432.
The previous prime is 1211033149399. The next prime is 1211033149481. The reversal of 1211033149433 is 3349413301121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1177665551209 + 33367598224 = 1085203^2 + 182668^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1211033149433 is a prime.
It is a super-2 number, since 2×12110331494332 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1211033149393 and 1211033149402.
It is not a weakly prime, because it can be changed into another prime (1211033149033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605516574716 + 605516574717.
It is an arithmetic number, because the mean of its divisors is an integer number (605516574717).
Almost surely, 21211033149433 is an apocalyptic number.
It is an amenable number.
1211033149433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211033149433 is an equidigital number, since it uses as much as digits as its factorization.
1211033149433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 1211033149433 in words is "one trillion, two hundred eleven billion, thirty-three million, one hundred forty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •