Base | Representation |
---|---|
bin | 1001100110101011010010… |
… | …10000011001110001111011 |
3 | 2202210001201111001100121212 |
4 | 10303111221100121301323 |
5 | 10232013001221231021 |
6 | 112530241011153335 |
7 | 4306610156550650 |
oct | 463255120316173 |
9 | 82701644040555 |
10 | 21120120102011 |
11 | 6802aa1219507 |
12 | 24512795a584b |
13 | ba28075c80c8 |
14 | 53030d951c27 |
15 | 2695b1dc885b |
hex | 133569419c7b |
21120120102011 has 4 divisors (see below), whose sum is σ = 24137280116592. Its totient is φ = 18102960087432.
The previous prime is 21120120101909. The next prime is 21120120102041. The reversal of 21120120102011 is 11020102102112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21120120102011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120120102041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1508580007280 + ... + 1508580007293.
It is an arithmetic number, because the mean of its divisors is an integer number (6034320029148).
Almost surely, 221120120102011 is an apocalyptic number.
21120120102011 is a deficient number, since it is larger than the sum of its proper divisors (3017160014581).
21120120102011 is an equidigital number, since it uses as much as digits as its factorization.
21120120102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3017160014580.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21120120102011 its reverse (11020102102112), we get a palindrome (32140222204123).
The spelling of 21120120102011 in words is "twenty-one trillion, one hundred twenty billion, one hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •