Base | Representation |
---|---|
bin | 1001000110011011101010… |
… | …10001010101010100010101 |
3 | 2121212011001000202102022011 |
4 | 10203031311101111110111 |
5 | 10110340011322010401 |
6 | 110321253105304221 |
7 | 4133556320161012 |
oct | 443156521252425 |
9 | 77764030672264 |
10 | 20012220110101 |
11 | 641615359768a |
12 | 22b2604035071 |
13 | b221b4c2410b |
14 | 4d284d1b4709 |
15 | 24a86cad4451 |
hex | 123375455515 |
20012220110101 has 4 divisors (see below), whose sum is σ = 20012501003392. Its totient is φ = 20011939216812.
The previous prime is 20012220110039. The next prime is 20012220110107. The reversal of 20012220110101 is 10101102221002.
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 a de Polignac number, because none of the positive numbers 2k-20012220110101 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 (20012220110107) 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, 140339751 + ... + 140482276.
It is an arithmetic number, because the mean of its divisors is an integer number (5003125250848).
Almost surely, 220012220110101 is an apocalyptic number.
It is an amenable number.
20012220110101 is a deficient number, since it is larger than the sum of its proper divisors (280893291).
20012220110101 is an equidigital number, since it uses as much as digits as its factorization.
20012220110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280893290.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20012220110101 its reverse (10101102221002), we get a palindrome (30113322331103).
The spelling of 20012220110101 in words is "twenty trillion, twelve billion, two hundred twenty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •