Base | Representation |
---|---|
bin | 1001101001010010111001… |
… | …00010101010111001001111 |
3 | 2210002122222102011200001010 |
4 | 10310221130202222321033 |
5 | 10240001241340200421 |
6 | 113035441432220303 |
7 | 4316244035453250 |
oct | 464513442527117 |
9 | 83078872150033 |
10 | 21210101100111 |
11 | 6838176141150 |
12 | 24667abb3a693 |
13 | bab1474c6351 |
14 | 534808104b27 |
15 | 26bacb750076 |
hex | 134a5c8aae4f |
21210101100111 has 64 divisors (see below), whose sum is σ = 36423923761152. Its totient is φ = 10654543440000.
The previous prime is 21210101100109. The next prime is 21210101100131. The reversal of 21210101100111 is 11100110101212.
It is not a de Polignac number, because 21210101100111 - 21 = 21210101100109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210101100131) 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 63 ways as a sum of consecutive naturals, for example, 8097721 + ... + 10391981.
It is an arithmetic number, because the mean of its divisors is an integer number (569123808768).
Almost surely, 221210101100111 is an apocalyptic number.
21210101100111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21210101100111 is a deficient number, since it is larger than the sum of its proper divisors (15213822661041).
21210101100111 is a wasteful number, since it uses less digits than its factorization.
21210101100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2295604.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 21210101100111 its reverse (11100110101212), we get a palindrome (32310211201323).
The spelling of 21210101100111 in words is "twenty-one trillion, two hundred ten billion, one hundred one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •