Base | Representation |
---|---|
bin | 10001110001010001001… |
… | …101110111100101110011 |
3 | 11022201221212202002111012 |
4 | 101301101031313211303 |
5 | 130001340111132011 |
6 | 2332551512341135 |
7 | 154136551543541 |
oct | 21612115674563 |
9 | 4281855662435 |
10 | 1221133302131 |
11 | 430974a06846 |
12 | 1787b70a47ab |
13 | 8b1c9a03302 |
14 | 4316313ad91 |
15 | 21b701b9a8b |
hex | 11c51377973 |
1221133302131 has 2 divisors, whose sum is σ = 1221133302132. Its totient is φ = 1221133302130.
The previous prime is 1221133302113. The next prime is 1221133302199. The reversal of 1221133302131 is 1312033311221.
Together with previous prime (1221133302113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1221133302131 - 222 = 1221129107827 is a prime.
It is a super-2 number, since 2×12211333021312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221133302097 and 1221133302106.
It is not a weakly prime, because it can be changed into another prime (1221133301131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610566651065 + 610566651066.
It is an arithmetic number, because the mean of its divisors is an integer number (610566651066).
Almost surely, 21221133302131 is an apocalyptic number.
1221133302131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221133302131 is an equidigital number, since it uses as much as digits as its factorization.
1221133302131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1221133302131 its reverse (1312033311221), we get a palindrome (2533166613352).
The spelling of 1221133302131 in words is "one trillion, two hundred twenty-one billion, one hundred thirty-three million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •