Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00001111110011001000110 |
3 | 2122011122012022212120011201 |
4 | 10210200201001332121012 |
5 | 10113313322241023420 |
6 | 110430134502253114 |
7 | 4143151355216443 |
oct | 444404101763106 |
9 | 78148168776151 |
10 | 20101001111110 |
11 | 644a872105797 |
12 | 230786072719a |
13 | b2a69332c2ca |
14 | 4d6c722389ca |
15 | 24cd16e2110a |
hex | 12482107e646 |
20101001111110 has 8 divisors (see below), whose sum is σ = 36181802000016. Its totient is φ = 8040400444440.
The previous prime is 20101001111099. The next prime is 20101001111131. The reversal of 20101001111110 is 1111110010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 2010100111111 = 20101001111110 / (2 + 0 + 1 + 0 + 1 + 0 + 0 + 1 + 1 + 1 + 1 + 1 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1005050055546 + ... + 1005050055565.
It is an arithmetic number, because the mean of its divisors is an integer number (4522725250002).
Almost surely, 220101001111110 is an apocalyptic number.
20101001111110 is a deficient number, since it is larger than the sum of its proper divisors (16080800888906).
20101001111110 is a wasteful number, since it uses less digits than its factorization.
20101001111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2010100111118.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 20101001111110 its reverse (1111110010102), we get a palindrome (21212111121212).
The spelling of 20101001111110 in words is "twenty trillion, one hundred one billion, one million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •