Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …010010000011010000001 |
3 | 10221020020010220112102100 |
4 | 100022321102100122001 |
5 | 121201224243224441 |
6 | 2210252145341013 |
7 | 143165552200254 |
oct | 20127122203201 |
9 | 3836203815370 |
10 | 1111210133121 |
11 | 399297172a20 |
12 | 15b43a037769 |
13 | 80a2c3c723a |
14 | 3bad623709b |
15 | 1dd89bebcb6 |
hex | 102b9490681 |
1111210133121 has 12 divisors (see below), whose sum is σ = 1750997785680. Its totient is φ = 673460686680.
The previous prime is 1111210133039. The next prime is 1111210133191. The reversal of 1111210133121 is 1213310121111.
It is not a de Polignac number, because 1111210133121 - 29 = 1111210132609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111210133094 and 1111210133103.
It is not an unprimeable number, because it can be changed into a prime (1111210133191) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5612172291 + ... + 5612172488.
It is an arithmetic number, because the mean of its divisors is an integer number (145916482140).
Almost surely, 21111210133121 is an apocalyptic number.
1111210133121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1111210133121 is a deficient number, since it is larger than the sum of its proper divisors (639787652559).
1111210133121 is a wasteful number, since it uses less digits than its factorization.
1111210133121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11224344796 (or 11224344793 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 1111210133121 its reverse (1213310121111), we get a palindrome (2324520254232).
The spelling of 1111210133121 in words is "one trillion, one hundred eleven billion, two hundred ten million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •