Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …011100110011100100111 |
3 | 10222011111120012101121102 |
4 | 100110000323212130213 |
5 | 121331303013310411 |
6 | 2214551541110315 |
7 | 143663322350324 |
oct | 20240073463447 |
9 | 3864446171542 |
10 | 1121002088231 |
11 | 3a24614aa803 |
12 | 1613113b839b |
13 | 8192cc7170c |
14 | 3c3848c1b4b |
15 | 1e25e6b1d3b |
hex | 10500ee6727 |
1121002088231 has 2 divisors, whose sum is σ = 1121002088232. Its totient is φ = 1121002088230.
The previous prime is 1121002088203. The next prime is 1121002088279. The reversal of 1121002088231 is 1328802001211.
It is a weak prime.
It is an emirp because it is prime and its reverse (1328802001211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121002088231 is a prime.
It is a super-2 number, since 2×11210020882312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121002088194 and 1121002088203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121002088281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560501044115 + 560501044116.
It is an arithmetic number, because the mean of its divisors is an integer number (560501044116).
Almost surely, 21121002088231 is an apocalyptic number.
1121002088231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121002088231 is an equidigital number, since it uses as much as digits as its factorization.
1121002088231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 29.
Adding to 1121002088231 its reverse (1328802001211), we get a palindrome (2449804089442).
The spelling of 1121002088231 in words is "one trillion, one hundred twenty-one billion, two million, eighty-eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •