Base | Representation |
---|---|
bin | 10000011101100001111… |
… | …110011000000010110101 |
3 | 11000010212200021012211010 |
4 | 100131201332120002311 |
5 | 122013214323441323 |
6 | 2223401513302433 |
7 | 144504455353332 |
oct | 20354176300265 |
9 | 4003780235733 |
10 | 1131220140213 |
11 | 3a6825307469 |
12 | 1632a3404a19 |
13 | 8289ab96a17 |
14 | 3ca739a5989 |
15 | 1e65b792c93 |
hex | 10761f980b5 |
1131220140213 has 32 divisors (see below), whose sum is σ = 1618066285056. Its totient is φ = 700483739648.
The previous prime is 1131220140161. The next prime is 1131220140227. The reversal of 1131220140213 is 3120410221311.
It is a cyclic number.
It is not a de Polignac number, because 1131220140213 - 232 = 1126925172917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131220140213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131220140233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 921556 + ... + 1764002.
It is an arithmetic number, because the mean of its divisors is an integer number (50564571408).
Almost surely, 21131220140213 is an apocalyptic number.
It is an amenable number.
1131220140213 is a deficient number, since it is larger than the sum of its proper divisors (486846144843).
1131220140213 is a wasteful number, since it uses less digits than its factorization.
1131220140213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 842813.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1131220140213 its reverse (3120410221311), we get a palindrome (4251630361524).
The spelling of 1131220140213 in words is "one trillion, one hundred thirty-one billion, two hundred twenty million, one hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •