Base | Representation |
---|---|
bin | 10001101000001001000… |
… | …101100100100101110101 |
3 | 11021210122220011222222022 |
4 | 101220021011210211311 |
5 | 124321302301424023 |
6 | 2324251231042525 |
7 | 153341652410501 |
oct | 21501105444565 |
9 | 4253586158868 |
10 | 1211333233013 |
11 | 4277a6037872 |
12 | 176921070445 |
13 | 8a2c7577847 |
14 | 428b377d301 |
15 | 21799b507c8 |
hex | 11a09164975 |
1211333233013 has 2 divisors, whose sum is σ = 1211333233014. Its totient is φ = 1211333233012.
The previous prime is 1211333232973. The next prime is 1211333233027. The reversal of 1211333233013 is 3103323331121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 927459524209 + 283873708804 = 963047^2 + 532798^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211333233013 - 238 = 936455326069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1211333233213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605666616506 + 605666616507.
It is an arithmetic number, because the mean of its divisors is an integer number (605666616507).
Almost surely, 21211333233013 is an apocalyptic number.
It is an amenable number.
1211333233013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211333233013 is an equidigital number, since it uses as much as digits as its factorization.
1211333233013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1211333233013 its reverse (3103323331121), we get a palindrome (4314656564134).
The spelling of 1211333233013 in words is "one trillion, two hundred eleven billion, three hundred thirty-three million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •