Base | Representation |
---|---|
bin | 1001001000111111100101… |
… | …01001110011000000110111 |
3 | 2122011120012002202111100121 |
4 | 10210133302221303000313 |
5 | 10113310224043133421 |
6 | 110425525345152411 |
7 | 4143123156445462 |
oct | 444376251630067 |
9 | 78146162674317 |
10 | 20100223021111 |
11 | 644a50297a202 |
12 | 230768402b707 |
13 | b2a59b07b01c |
14 | 4d6bdab742d9 |
15 | 24ccbd975d41 |
hex | 1247f2a73037 |
20100223021111 has 4 divisors (see below), whose sum is σ = 20793334159800. Its totient is φ = 19407111882424.
The previous prime is 20100223021103. The next prime is 20100223021141. The reversal of 20100223021111 is 11112032200102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20100223021111 - 23 = 20100223021103 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 (20100223021141) 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, 346555569301 + ... + 346555569358.
It is an arithmetic number, because the mean of its divisors is an integer number (5198333539950).
Almost surely, 220100223021111 is an apocalyptic number.
20100223021111 is a deficient number, since it is larger than the sum of its proper divisors (693111138689).
20100223021111 is an equidigital number, since it uses as much as digits as its factorization.
20100223021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693111138688.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20100223021111 its reverse (11112032200102), we get a palindrome (31212255221213).
The spelling of 20100223021111 in words is "twenty trillion, one hundred billion, two hundred twenty-three million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •