Base | Representation |
---|---|
bin | 10000001011110000001… |
… | …100010001010110101101 |
3 | 10221022121100021012221100 |
4 | 100023300030101112231 |
5 | 121210121103423041 |
6 | 2210523413353313 |
7 | 143230436112153 |
oct | 20136014212655 |
9 | 3838540235840 |
10 | 1112131311021 |
11 | 39971a14a575 |
12 | 15b656638839 |
13 | 80b481c7213 |
14 | 3bb827073d3 |
15 | 1dde0a0d6b6 |
hex | 102f03115ad |
1112131311021 has 12 divisors (see below), whose sum is σ = 1606423104000. Its totient is φ = 741415700040.
The previous prime is 1112131311013. The next prime is 1112131311139. The reversal of 1112131311021 is 1201131312111.
It is not a de Polignac number, because 1112131311021 - 23 = 1112131311013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112131310985 and 1112131311003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112131312021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1293076 + ... + 1973906.
It is an arithmetic number, because the mean of its divisors is an integer number (133868592000).
Almost surely, 21112131311021 is an apocalyptic number.
It is an amenable number.
1112131311021 is a deficient number, since it is larger than the sum of its proper divisors (494291792979).
1112131311021 is a wasteful number, since it uses less digits than its factorization.
1112131311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862336 (or 862333 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 1112131311021 its reverse (1201131312111), we get a palindrome (2313262623132).
The spelling of 1112131311021 in words is "one trillion, one hundred twelve billion, one hundred thirty-one million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •