Base | Representation |
---|---|
bin | 10000011101100111011… |
… | …001010111100100001101 |
3 | 11000011010000102120020101 |
4 | 100131213121113210031 |
5 | 122013411120232341 |
6 | 2223414523051101 |
7 | 144506641463566 |
oct | 20354731274415 |
9 | 4004100376211 |
10 | 1131311102221 |
11 | 3a6871695583 |
12 | 163309970a91 |
13 | 828b39947b1 |
14 | 3ca81ac316d |
15 | 1e66475e831 |
hex | 1076765790d |
1131311102221 has 8 divisors (see below), whose sum is σ = 1195441562880. Its totient is φ = 1068425893392.
The previous prime is 1131311102197. The next prime is 1131311102237. The reversal of 1131311102221 is 1222011131311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1131311102221 - 217 = 1131310971149 is a prime.
It is a super-2 number, since 2×11313111022212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131311102261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311311090 + ... + 311314723.
It is an arithmetic number, because the mean of its divisors is an integer number (149430195360).
Almost surely, 21131311102221 is an apocalyptic number.
It is an amenable number.
1131311102221 is a deficient number, since it is larger than the sum of its proper divisors (64130460659).
1131311102221 is an equidigital number, since it uses as much as digits as its factorization.
1131311102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622625915.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1131311102221 its reverse (1222011131311), we get a palindrome (2353322233532).
The spelling of 1131311102221 in words is "one trillion, one hundred thirty-one billion, three hundred eleven million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •