Base | Representation |
---|---|
bin | 10000100110111011011… |
… | …100110000011011001011 |
3 | 11001002220221101201212102 |
4 | 100212323130300123023 |
5 | 122144401132224321 |
6 | 2232151112104015 |
7 | 145312520141363 |
oct | 20467334603313 |
9 | 4032827351772 |
10 | 1141311211211 |
11 | 400033474466 |
12 | 16523a99500b |
13 | 838186bc752 |
14 | 3d34dc739a3 |
15 | 1ea4c63ec0b |
hex | 109bb7306cb |
1141311211211 has 2 divisors, whose sum is σ = 1141311211212. Its totient is φ = 1141311211210.
The previous prime is 1141311211207. The next prime is 1141311211259. The reversal of 1141311211211 is 1121121131411.
It is a m-pointer prime, because the next prime (1141311211259) can be obtained adding 1141311211211 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1141311211211 - 22 = 1141311211207 is a prime.
It is a super-4 number, since 4×11413112112114 (a number of 49 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (1141311211511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570655605605 + 570655605606.
It is an arithmetic number, because the mean of its divisors is an integer number (570655605606).
Almost surely, 21141311211211 is an apocalyptic number.
1141311211211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141311211211 is an equidigital number, since it uses as much as digits as its factorization.
1141311211211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 20.
Adding to 1141311211211 its reverse (1121121131411), we get a palindrome (2262432342622).
The spelling of 1141311211211 in words is "one trillion, one hundred forty-one billion, three hundred eleven million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •