Base | Representation |
---|---|
bin | 1001100011011110010111… |
… | …00111100110010011101111 |
3 | 2202101112202002002001201102 |
4 | 10301233023213212103233 |
5 | 10223212141401400421 |
6 | 112403523544233315 |
7 | 4265633615403632 |
oct | 461571347462357 |
9 | 82345662061642 |
10 | 21010101200111 |
11 | 67703744390a1 |
12 | 2433a9446b83b |
13 | b9532321085a |
14 | 528c7404bc19 |
15 | 2667c32ea60b |
hex | 131bcb9e64ef |
21010101200111 has 4 divisors (see below), whose sum is σ = 21010353472224. Its totient is φ = 21009848928000.
The previous prime is 21010101200017. The next prime is 21010101200161. The reversal of 21010101200111 is 11100210101012.
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-21010101200111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010101200092 and 21010101200101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010101200161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126011090 + ... + 126177711.
It is an arithmetic number, because the mean of its divisors is an integer number (5252588368056).
Almost surely, 221010101200111 is an apocalyptic number.
21010101200111 is a deficient number, since it is larger than the sum of its proper divisors (252272113).
21010101200111 is an equidigital number, since it uses as much as digits as its factorization.
21010101200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252272112.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21010101200111 its reverse (11100210101012), we get a palindrome (32110311301123).
The spelling of 21010101200111 in words is "twenty-one trillion, ten billion, one hundred one million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •