Base | Representation |
---|---|
bin | 10000011110011101001… |
… | …010010101111110010001 |
3 | 11000020102212202111010012 |
4 | 100132131022111332101 |
5 | 122022233030230301 |
6 | 2224044224444305 |
7 | 144541203561533 |
oct | 20363512257621 |
9 | 4006385674105 |
10 | 1132213133201 |
11 | 3a7194884827 |
12 | 16351ba79695 |
13 | 829c881c737 |
14 | 3cb2980b853 |
15 | 1e6b8a3cebb |
hex | 1079d295f91 |
1132213133201 has 8 divisors (see below), whose sum is σ = 1133075059200. Its totient is φ = 1131351388128.
The previous prime is 1132213133189. The next prime is 1132213133213. The reversal of 1132213133201 is 1023313122311.
It is an interprime number because it is at equal distance from previous prime (1132213133189) and next prime (1132213133213).
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 1132213133201 - 230 = 1131139391377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132213133281) 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, 14139860 + ... + 14219706.
It is an arithmetic number, because the mean of its divisors is an integer number (141634382400).
Almost surely, 21132213133201 is an apocalyptic number.
It is an amenable number.
1132213133201 is a deficient number, since it is larger than the sum of its proper divisors (861925999).
1132213133201 is an equidigital number, since it uses as much as digits as its factorization.
1132213133201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90463.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1132213133201 its reverse (1023313122311), we get a palindrome (2155526255512).
The spelling of 1132213133201 in words is "one trillion, one hundred thirty-two billion, two hundred thirteen million, one hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •