Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …100010110110110101001 |
3 | 10221022021021122111020012 |
4 | 100023220130112312221 |
5 | 121204334313410441 |
6 | 2210502451141305 |
7 | 143224300115612 |
oct | 20135034266651 |
9 | 3838237574205 |
10 | 1112001310121 |
11 | 399662827a09 |
12 | 15b61aba4835 |
13 | 80b272ab200 |
14 | 3bb6d346c09 |
15 | 1ddd43ce9eb |
hex | 102e8716da9 |
1112001310121 has 12 divisors (see below), whose sum is σ = 1229739340032. Its totient is φ = 1004623107696.
The previous prime is 1112001310019. The next prime is 1112001310159. The reversal of 1112001310121 is 1210131002111.
It is not a de Polignac number, because 1112001310121 - 218 = 1112001047977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112001310096 and 1112001310105.
It is not an unprimeable number, because it can be changed into a prime (1112001310621) 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 11 ways as a sum of consecutive naturals, for example, 69990881 + ... + 70006766.
It is an arithmetic number, because the mean of its divisors is an integer number (102478278336).
Almost surely, 21112001310121 is an apocalyptic number.
It is an amenable number.
1112001310121 is a deficient number, since it is larger than the sum of its proper divisors (117738029911).
1112001310121 is a wasteful number, since it uses less digits than its factorization.
1112001310121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139997720 (or 139997707 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1112001310121 its reverse (1210131002111), we get a palindrome (2322132312232).
The spelling of 1112001310121 in words is "one trillion, one hundred twelve billion, one million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •