Base | Representation |
---|---|
bin | 10001110001010001001… |
… | …100110101011101000001 |
3 | 11022201221212020022212221 |
4 | 101301101030311131001 |
5 | 130001340023444413 |
6 | 2332551502451041 |
7 | 154136546335003 |
oct | 21612114653501 |
9 | 4281855208787 |
10 | 1221133031233 |
11 | 430974841265 |
12 | 1787b6b93a81 |
13 | 8b1c9939c0b |
14 | 431630aa373 |
15 | 21b7016468d |
hex | 11c51335741 |
1221133031233 has 2 divisors, whose sum is σ = 1221133031234. Its totient is φ = 1221133031232.
The previous prime is 1221133031231. The next prime is 1221133031257. The reversal of 1221133031233 is 3321303311221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1177337842704 + 43795188529 = 1085052^2 + 209273^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221133031233 - 21 = 1221133031231 is a prime.
Together with 1221133031231, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1221133031198 and 1221133031207.
It is not a weakly prime, because it can be changed into another prime (1221133031231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610566515616 + 610566515617.
It is an arithmetic number, because the mean of its divisors is an integer number (610566515617).
Almost surely, 21221133031233 is an apocalyptic number.
It is an amenable number.
1221133031233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221133031233 is an equidigital number, since it uses as much as digits as its factorization.
1221133031233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1221133031233 its reverse (3321303311221), we get a palindrome (4542436342454).
The spelling of 1221133031233 in words is "one trillion, two hundred twenty-one billion, one hundred thirty-three million, thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •