Base | Representation |
---|---|
bin | 1001100110101011000110… |
… | …10110010110111110100101 |
3 | 2202210001110120120110100202 |
4 | 10303111203112112332211 |
5 | 10232012300334000401 |
6 | 112530223111120245 |
7 | 4306604544316052 |
oct | 463254326267645 |
9 | 82701416513322 |
10 | 21120021000101 |
11 | 6802a50290801 |
12 | 2451250373085 |
13 | ba27bcc0a31a |
14 | 530300716029 |
15 | 2695a835006b |
hex | 133563596fa5 |
21120021000101 has 4 divisors (see below), whose sum is σ = 21120400455072. Its totient is φ = 21119641545132.
The previous prime is 21120021000079. The next prime is 21120021000149. The reversal of 21120021000101 is 10100012002112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21120021000101 - 214 = 21120020983717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120021000161) 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, 189643985 + ... + 189755318.
It is an arithmetic number, because the mean of its divisors is an integer number (5280100113768).
Almost surely, 221120021000101 is an apocalyptic number.
It is an amenable number.
21120021000101 is a deficient number, since it is larger than the sum of its proper divisors (379454971).
21120021000101 is an equidigital number, since it uses as much as digits as its factorization.
21120021000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379454970.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21120021000101 its reverse (10100012002112), we get a palindrome (31220033002213).
The spelling of 21120021000101 in words is "twenty-one trillion, one hundred twenty billion, twenty-one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •