Base | Representation |
---|---|
bin | 10000011111001101111… |
… | …010110000110000111101 |
3 | 11000022112212222010211012 |
4 | 100133031322300300331 |
5 | 122030421432212341 |
6 | 2224301325205005 |
7 | 144600365501402 |
oct | 20371572606075 |
9 | 4008485863735 |
10 | 1133031132221 |
11 | 3a757459957a |
12 | 163709a00765 |
13 | 82ac9135021 |
14 | 3cba63002a9 |
15 | 1e71576d0eb |
hex | 107cdeb0c3d |
1133031132221 has 4 divisors (see below), whose sum is σ = 1163653595292. Its totient is φ = 1102408669152.
The previous prime is 1133031132209. The next prime is 1133031132239. The reversal of 1133031132221 is 1222311303311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 571325851321 + 561705280900 = 755861^2 + 749470^2 .
It is not a de Polignac number, because 1133031132221 - 26 = 1133031132157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133031132241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15311231480 + ... + 15311231553.
It is an arithmetic number, because the mean of its divisors is an integer number (290913398823).
Almost surely, 21133031132221 is an apocalyptic number.
It is an amenable number.
1133031132221 is a deficient number, since it is larger than the sum of its proper divisors (30622463071).
1133031132221 is an equidigital number, since it uses as much as digits as its factorization.
1133031132221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30622463070.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1133031132221 its reverse (1222311303311), we get a palindrome (2355342435532).
The spelling of 1133031132221 in words is "one trillion, one hundred thirty-three billion, thirty-one million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •