Base | Representation |
---|---|
bin | 10000011110100100001… |
… | …000001100100111111101 |
3 | 11000020202000200111111111 |
4 | 100132210020030213331 |
5 | 122023002440324013 |
6 | 2224104001522021 |
7 | 144544123200526 |
oct | 20364410144775 |
9 | 4006660614444 |
10 | 1132330011133 |
11 | 3a7244853962 |
12 | 163553043311 |
13 | 82a16ac2589 |
14 | 3cb3b15384d |
15 | 1e6c3e2873d |
hex | 107a420c9fd |
1132330011133 has 16 divisors (see below), whose sum is σ = 1160522510400. Its totient is φ = 1104440621440.
The previous prime is 1132330011119. The next prime is 1132330011149. The reversal of 1132330011133 is 3311100332311.
It is a cyclic number.
It is not a de Polignac number, because 1132330011133 - 25 = 1132330011101 is a prime.
It is a super-2 number, since 2×11323300111332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132330011173) 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 15 ways as a sum of consecutive naturals, for example, 60500985 + ... + 60519697.
It is an arithmetic number, because the mean of its divisors is an integer number (72532656900).
Almost surely, 21132330011133 is an apocalyptic number.
It is an amenable number.
1132330011133 is a deficient number, since it is larger than the sum of its proper divisors (28192499267).
1132330011133 is a wasteful number, since it uses less digits than its factorization.
1132330011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26732.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1132330011133 its reverse (3311100332311), we get a palindrome (4443430343444).
The spelling of 1132330011133 in words is "one trillion, one hundred thirty-two billion, three hundred thirty million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •