Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …010001010110010101001 |
3 | 10221020020010212100212111 |
4 | 100022321102022302221 |
5 | 121201224242010441 |
6 | 2210252145042321 |
7 | 143165552043226 |
oct | 20127122126251 |
9 | 3836203770774 |
10 | 1111210110121 |
11 | 399297157711 |
12 | 15b43a0263a1 |
13 | 80a2c3b9927 |
14 | 3bad622c94d |
15 | 1dd89be5081 |
hex | 102b948aca9 |
1111210110121 has 16 divisors (see below), whose sum is σ = 1124605440000. Its totient is φ = 1097896069008.
The previous prime is 1111210110079. The next prime is 1111210110139. The reversal of 1111210110121 is 1210110121111.
It is a cyclic number.
It is not a de Polignac number, because 1111210110121 - 27 = 1111210109993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111210110161) 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 15 ways as a sum of consecutive naturals, for example, 94621576 + ... + 94633318.
It is an arithmetic number, because the mean of its divisors is an integer number (70287840000).
Almost surely, 21111210110121 is an apocalyptic number.
It is an amenable number.
1111210110121 is a deficient number, since it is larger than the sum of its proper divisors (13395329879).
1111210110121 is a wasteful number, since it uses less digits than its factorization.
1111210110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15108.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1111210110121 its reverse (1210110121111), we get a palindrome (2321320231232).
It can be divided in two parts, 111 and 1210110121, that multiplied together give a palindrome (134322223431).
The spelling of 1111210110121 in words is "one trillion, one hundred eleven billion, two hundred ten million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •