Base | Representation |
---|---|
bin | 10000001011111100000… |
… | …110000111001100011101 |
3 | 10221100010021001122110020 |
4 | 100023330012013030131 |
5 | 121211023220220013 |
6 | 2210555310102353 |
7 | 143235412460211 |
oct | 20137406071435 |
9 | 3840107048406 |
10 | 1112331023133 |
11 | 399811956200 |
12 | 15b6b14aa9b9 |
13 | 80b7a6b0475 |
14 | 3bba1052941 |
15 | 1de0330c623 |
hex | 102fc18731d |
1112331023133 has 48 divisors (see below), whose sum is σ = 1687274984640. Its totient is φ = 650558684160.
The previous prime is 1112331023081. The next prime is 1112331023143. The reversal of 1112331023133 is 3313201332111.
It is not a de Polignac number, because 1112331023133 - 210 = 1112331022109 is a prime.
It is a super-2 number, since 2×11123310231332 (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 (1112331023143) 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 47 ways as a sum of consecutive naturals, for example, 21206766 + ... + 21259152.
It is an arithmetic number, because the mean of its divisors is an integer number (35151562180).
Almost surely, 21112331023133 is an apocalyptic number.
It is an amenable number.
1112331023133 is a deficient number, since it is larger than the sum of its proper divisors (574943961507).
1112331023133 is a wasteful number, since it uses less digits than its factorization.
1112331023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54458 (or 54447 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 1112331023133 its reverse (3313201332111), we get a palindrome (4425532355244).
The spelling of 1112331023133 in words is "one trillion, one hundred twelve billion, three hundred thirty-one million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •