Base | Representation |
---|---|
bin | 10000011110010111000… |
… | …000111101101011111101 |
3 | 11000020011200201100020100 |
4 | 100132113000331223331 |
5 | 122022030130324013 |
6 | 2224030102311313 |
7 | 144535512214233 |
oct | 20362700755375 |
9 | 4006150640210 |
10 | 1132110011133 |
11 | 3a7141650682 |
12 | 1634b1428539 |
13 | 829b0354b6a |
14 | 3cb19c46953 |
15 | 1e6ae96d473 |
hex | 1079703dafd |
1132110011133 has 24 divisors (see below), whose sum is σ = 1647592202880. Its totient is φ = 749065734720.
The previous prime is 1132110011119. The next prime is 1132110011143. The reversal of 1132110011133 is 3311100112311.
It is not a de Polignac number, because 1132110011133 - 24 = 1132110011117 is a prime.
It is a super-2 number, since 2×11321100111332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132110011143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 518113 + ... + 1591433.
It is an arithmetic number, because the mean of its divisors is an integer number (68649675120).
Almost surely, 21132110011133 is an apocalyptic number.
It is an amenable number.
1132110011133 is a deficient number, since it is larger than the sum of its proper divisors (515482191747).
1132110011133 is a wasteful number, since it uses less digits than its factorization.
1132110011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074209 (or 1074206 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1132110011133 its reverse (3311100112311), we get a palindrome (4443210123444).
The spelling of 1132110011133 in words is "one trillion, one hundred thirty-two billion, one hundred ten million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •