Base | Representation |
---|---|
bin | 10011101001111001… |
… | …111001111110110011 |
3 | 2000110210011101212122 |
4 | 103221321321332303 |
5 | 321210124441321 |
6 | 13410050544455 |
7 | 1344660142400 |
oct | 235171717663 |
9 | 60423141778 |
10 | 21104140211 |
11 | 8a4a8119a0 |
12 | 410b89812b |
13 | 1cb4377c3b |
14 | 1042bc12a7 |
15 | 837b6d8ab |
hex | 4e9e79fb3 |
21104140211 has 12 divisors (see below), whose sum is σ = 26781507000. Its totient is φ = 16444784160.
The previous prime is 21104140193. The next prime is 21104140231. The reversal of 21104140211 is 11204140112.
It is not a de Polignac number, because 21104140211 - 26 = 21104140147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21104140211.
It is not an unprimeable number, because it can be changed into a prime (21104140231) 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 11 ways as a sum of consecutive naturals, for example, 19576586 + ... + 19577663.
It is an arithmetic number, because the mean of its divisors is an integer number (2231792250).
Almost surely, 221104140211 is an apocalyptic number.
21104140211 is a deficient number, since it is larger than the sum of its proper divisors (5677366789).
21104140211 is a wasteful number, since it uses less digits than its factorization.
21104140211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39154274 (or 39154267 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21104140211 its reverse (11204140112), we get a palindrome (32308280323).
Subtracting from 21104140211 its reverse (11204140112), we obtain a palindrome (9900000099).
The spelling of 21104140211 in words is "twenty-one billion, one hundred four million, one hundred forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •