Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …110010000101001100101 |
3 | 10222002011202122212200101 |
4 | 100103023032100221211 |
5 | 121322431324310041 |
6 | 2214322311544101 |
7 | 143632101331210 |
oct | 20231316205145 |
9 | 3862152585611 |
10 | 1120101010021 |
11 | 3a2039901374 |
12 | 1610bb68b031 |
13 | 8181838b346 |
14 | 3c2dad64777 |
15 | 1e20a520b31 |
hex | 104cb390a65 |
1120101010021 has 16 divisors (see below), whose sum is σ = 1293387661440. Its totient is φ = 950133565440.
The previous prime is 1120101010009. The next prime is 1120101010033. The reversal of 1120101010021 is 1200101010211.
It is an interprime number because it is at equal distance from previous prime (1120101010009) and next prime (1120101010033).
It is a cyclic number.
It is not a de Polignac number, because 1120101010021 - 239 = 570345196133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120101010081) 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, 15227910 + ... + 15301288.
It is an arithmetic number, because the mean of its divisors is an integer number (80836728840).
Almost surely, 21120101010021 is an apocalyptic number.
It is an amenable number.
1120101010021 is a deficient number, since it is larger than the sum of its proper divisors (173286651419).
1120101010021 is an equidigital number, since it uses as much as digits as its factorization.
1120101010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95964.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1120101010021 its reverse (1200101010211), we get a palindrome (2320202020232).
The spelling of 1120101010021 in words is "one trillion, one hundred twenty billion, one hundred one million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •