Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …00100101001011111100010 |
3 | 2121212001011001010211000200 |
4 | 10203030302210221133202 |
5 | 10110330213340200002 |
6 | 110320550053130030 |
7 | 4133516511560625 |
oct | 443146244513742 |
9 | 77761131124020 |
10 | 20011101100002 |
11 | 6415729978851 |
12 | 22b2351329916 |
13 | b2206714876c |
14 | 4d2784727dbc |
15 | 24a804745b1c |
hex | 1233329297e2 |
20011101100002 has 12 divisors (see below), whose sum is σ = 43357385716710. Its totient is φ = 6670367033328.
The previous prime is 20011101099991. The next prime is 20011101100009. The reversal of 20011101100002 is 20000110111002.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 19888558396281 + 122542703721 = 4459659^2 + 350061^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20011101100009) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 555863919427 + ... + 555863919462.
Almost surely, 220011101100002 is an apocalyptic number.
20011101100002 is an abundant number, since it is smaller than the sum of its proper divisors (23346284616708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20011101100002 is a wasteful number, since it uses less digits than its factorization.
20011101100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111727838897 (or 1111727838894 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20011101100002 its reverse (20000110111002), we get a palindrome (40011211211004).
The spelling of 20011101100002 in words is "twenty trillion, eleven billion, one hundred one million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •