Base | Representation |
---|---|
bin | 1001001000111111011001… |
… | …00101011000101000111011 |
3 | 2122011112221000011111201012 |
4 | 10210133230211120220323 |
5 | 10113310022011414321 |
6 | 110425511310544135 |
7 | 4143120512133452 |
oct | 444375445305073 |
9 | 78145830144635 |
10 | 20100121201211 |
11 | 644a460455427 |
12 | 2307655b0804b |
13 | b2a582c4b06c |
14 | 4d6bcb42bb99 |
15 | 24ccb4a6205b |
hex | 1247ec958a3b |
20100121201211 has 4 divisors (see below), whose sum is σ = 20106739617552. Its totient is φ = 20093502784872.
The previous prime is 20100121201201. The next prime is 20100121201253. The reversal of 20100121201211 is 11210212100102.
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-20100121201211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20100121201201) 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 3 ways as a sum of consecutive naturals, for example, 3309203615 + ... + 3309209688.
It is an arithmetic number, because the mean of its divisors is an integer number (5026684904388).
Almost surely, 220100121201211 is an apocalyptic number.
20100121201211 is a deficient number, since it is larger than the sum of its proper divisors (6618416341).
20100121201211 is an equidigital number, since it uses as much as digits as its factorization.
20100121201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6618416340.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20100121201211 its reverse (11210212100102), we get a palindrome (31310333301313).
The spelling of 20100121201211 in words is "twenty trillion, one hundred billion, one hundred twenty-one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •