Base | Representation |
---|---|
bin | 10000010100000001011… |
… | …001110100011111110101 |
3 | 10222011112010002212101000 |
4 | 100110001121310133311 |
5 | 121331312030310401 |
6 | 2214552422553513 |
7 | 143663446603212 |
oct | 20240131643765 |
9 | 3864463085330 |
10 | 1121010010101 |
11 | 3a2465a20603 |
12 | 161313b98899 |
13 | 819317b6407 |
14 | 3c385984b09 |
15 | 1e260229186 |
hex | 105016747f5 |
1121010010101 has 16 divisors (see below), whose sum is σ = 1661068955520. Its totient is φ = 747198983520.
The previous prime is 1121010010073. The next prime is 1121010010123. The reversal of 1121010010101 is 1010100101211.
It is a de Polignac number, because none of the positive numbers 2k-1121010010101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121010010181) 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 15 ways as a sum of consecutive naturals, for example, 3771480 + ... + 4057841.
It is an arithmetic number, because the mean of its divisors is an integer number (103816809720).
Almost surely, 21121010010101 is an apocalyptic number.
It is an amenable number.
1121010010101 is a deficient number, since it is larger than the sum of its proper divisors (540058945419).
1121010010101 is an equidigital number, since it uses as much as digits as its factorization.
1121010010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7834633 (or 7834627 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1121010010101 its reverse (1010100101211), we get a palindrome (2131110111312).
The spelling of 1121010010101 in words is "one trillion, one hundred twenty-one billion, ten million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •