Base | Representation |
---|---|
bin | 1001100110101100111110… |
… | …11111110011111110000110 |
3 | 2202210011001220101121102120 |
4 | 10303112133133303332012 |
5 | 10232021332202023420 |
6 | 112530511155550410 |
7 | 4306641546524466 |
oct | 463263737637606 |
9 | 82704056347376 |
10 | 21121030111110 |
11 | 6803418967846 |
12 | 24514922bb406 |
13 | ba2920cb7527 |
14 | 530398755ba6 |
15 | 269616c30d40 |
hex | 13359f7f3f86 |
21121030111110 has 32 divisors (see below), whose sum is σ = 51869320462080. Its totient is φ = 5501291563488.
The previous prime is 21121030111081. The next prime is 21121030111151. The reversal of 21121030111110 is 1111103012112.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 21121030111110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8186444490 + ... + 8186447069.
It is an arithmetic number, because the mean of its divisors is an integer number (1620916264440).
Almost surely, 221121030111110 is an apocalyptic number.
21121030111110 is an abundant number, since it is smaller than the sum of its proper divisors (30748290350970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21121030111110 is a wasteful number, since it uses less digits than its factorization.
21121030111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16372891612.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 21121030111110 its reverse (1111103012112), we get a palindrome (22232133123222).
The spelling of 21121030111110 in words is "twenty-one trillion, one hundred twenty-one billion, thirty million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •