Base | Representation |
---|---|
bin | 10000011110100011000… |
… | …000011100100110100101 |
3 | 11000020200201021220111211 |
4 | 100132203000130212211 |
5 | 122022433131432323 |
6 | 2224102050431421 |
7 | 144543504262162 |
oct | 20364300344645 |
9 | 4006621256454 |
10 | 1132311202213 |
11 | 3a72351774a4 |
12 | 163548892571 |
13 | 82a12c38339 |
14 | 3cb38859069 |
15 | 1e6c246070d |
hex | 107a301c9a5 |
1132311202213 has 8 divisors (see below), whose sum is σ = 1135470900960. Its totient is φ = 1129155872880.
The previous prime is 1132311202193. The next prime is 1132311202261. The reversal of 1132311202213 is 3122021132311.
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 1132311202213 - 25 = 1132311202181 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 (1132311202273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 572998 + ... + 1610263.
It is an arithmetic number, because the mean of its divisors is an integer number (141933862620).
Almost surely, 21132311202213 is an apocalyptic number.
It is an amenable number.
1132311202213 is a deficient number, since it is larger than the sum of its proper divisors (3159698747).
1132311202213 is an equidigital number, since it uses as much as digits as its factorization.
1132311202213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184707.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1132311202213 its reverse (3122021132311), we get a palindrome (4254332334524).
The spelling of 1132311202213 in words is "one trillion, one hundred thirty-two billion, three hundred eleven million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •