Base | Representation |
---|---|
bin | 10010101000101101… |
… | …001111011100011011 |
3 | 1220122112220121212002 |
4 | 102220231033130123 |
5 | 311440114114321 |
6 | 13105334111215 |
7 | 1305605516405 |
oct | 225055173433 |
9 | 56575817762 |
10 | 20010301211 |
11 | 853932551a |
12 | 3a654ab50b |
13 | 1b6b873624 |
14 | d7b807b75 |
15 | 7c1b0320b |
hex | 4a8b4f71b |
20010301211 has 4 divisors (see below), whose sum is σ = 20011043400. Its totient is φ = 20009559024.
The previous prime is 20010301189. The next prime is 20010301219. The reversal of 20010301211 is 11210301002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11210301002 = 2 ⋅5605150501.
It is a cyclic number.
It is not a de Polignac number, because 20010301211 - 234 = 2830432027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010301192 and 20010301201.
It is not an unprimeable number, because it can be changed into a prime (20010301219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329066 + ... + 385103.
It is an arithmetic number, because the mean of its divisors is an integer number (5002760850).
Almost surely, 220010301211 is an apocalyptic number.
20010301211 is a deficient number, since it is larger than the sum of its proper divisors (742189).
20010301211 is an equidigital number, since it uses as much as digits as its factorization.
20010301211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742188.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20010301211 its reverse (11210301002), we get a palindrome (31220602213).
The spelling of 20010301211 in words is "twenty billion, ten million, three hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •