Base | Representation |
---|---|
bin | 10000011110100010011… |
… | …010101101110010011101 |
3 | 11000020200000200101111112 |
4 | 100132202122231302131 |
5 | 122022423113424013 |
6 | 2224101054431405 |
7 | 144543324225206 |
oct | 20364232556235 |
9 | 4006600611445 |
10 | 1132301311133 |
11 | 3a722a631153 |
12 | 163545502565 |
13 | 82a10b84225 |
14 | 3cb374025ad |
15 | 1e6c1659ba8 |
hex | 107a26adc9d |
1132301311133 has 8 divisors (see below), whose sum is σ = 1161052780800. Its totient is φ = 1103659790688.
The previous prime is 1132301311117. The next prime is 1132301311189. The reversal of 1132301311133 is 3311131032311.
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 1132301311133 - 24 = 1132301311117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132301311099 and 1132301311108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132301311103) 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, 27466448 + ... + 27507641.
It is an arithmetic number, because the mean of its divisors is an integer number (145131597600).
Almost surely, 21132301311133 is an apocalyptic number.
It is an amenable number.
1132301311133 is a deficient number, since it is larger than the sum of its proper divisors (28751469667).
1132301311133 is an equidigital number, since it uses as much as digits as its factorization.
1132301311133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54974611.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1132301311133 its reverse (3311131032311), we get a palindrome (4443432343444).
The spelling of 1132301311133 in words is "one trillion, one hundred thirty-two billion, three hundred one million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •