Base | Representation |
---|---|
bin | 101111110001101011010111… |
… | …001011001110111011101101 |
3 | 1000112222110121110120120210210 |
4 | 233301223113023032323231 |
5 | 210020114324011213401 |
6 | 2022520414140053033 |
7 | 62154546020510064 |
oct | 5761532713167355 |
9 | 1015873543516723 |
10 | 210122000101101 |
11 | 60a51270208000 |
12 | 1b697074834179 |
13 | 903255bab2b2a |
14 | 39c5d5d97d1db |
15 | 1945b4e86a4d6 |
hex | bf1ad72ceeed |
210122000101101 has 32 divisors (see below), whose sum is σ = 308214469468800. Its totient is φ = 127323282894720.
The previous prime is 210122000101087. The next prime is 210122000101103. The reversal of 210122000101101 is 101101000221012.
It is not a de Polignac number, because 210122000101101 - 233 = 210113410166509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210122000101103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16929211 + ... + 26586503.
It is an arithmetic number, because the mean of its divisors is an integer number (9631702170900).
Almost surely, 2210122000101101 is an apocalyptic number.
It is an amenable number.
210122000101101 is a deficient number, since it is larger than the sum of its proper divisors (98092469367699).
210122000101101 is an equidigital number, since it uses as much as digits as its factorization.
210122000101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9662778 (or 9662756 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210122000101101 its reverse (101101000221012), we get a palindrome (311223000322113).
The spelling of 210122000101101 in words is "two hundred ten trillion, one hundred twenty-two billion, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •