Base | Representation |
---|---|
bin | 10000010101000101011… |
… | …100011101011001110111 |
3 | 10222021110200010020022222 |
4 | 100111011130131121313 |
5 | 121341131244141011 |
6 | 2215302002112555 |
7 | 144033650550434 |
oct | 20250534353167 |
9 | 3867420106288 |
10 | 1122151552631 |
11 | 3a29a132a38a |
12 | 16159234b75b |
13 | 81a84150a75 |
14 | 3c453418b8b |
15 | 1e2ca568ddb |
hex | 1054571d677 |
1122151552631 has 2 divisors, whose sum is σ = 1122151552632. Its totient is φ = 1122151552630.
The previous prime is 1122151552609. The next prime is 1122151552633. The reversal of 1122151552631 is 1362551512211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1362551512211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1122151552631 - 218 = 1122151290487 is a prime.
It is a super-2 number, since 2×11221515526312 (a number of 25 digits) contains 22 as substring.
Together with 1122151552633, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122151552591 and 1122151552600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122151552633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561075776315 + 561075776316.
It is an arithmetic number, because the mean of its divisors is an integer number (561075776316).
Almost surely, 21122151552631 is an apocalyptic number.
1122151552631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122151552631 is an equidigital number, since it uses as much as digits as its factorization.
1122151552631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18000, while the sum is 35.
The spelling of 1122151552631 in words is "one trillion, one hundred twenty-two billion, one hundred fifty-one million, five hundred fifty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •