Base | Representation |
---|---|
bin | 1001000110000101000111… |
… | …01001001011011011011101 |
3 | 2121210222210021111020002111 |
4 | 10203002203221023123131 |
5 | 10110140212440223401 |
6 | 110311531500354021 |
7 | 4132650310216252 |
oct | 443024351133335 |
9 | 77728707436074 |
10 | 20000113211101 |
11 | 6411000562231 |
12 | 22b01a5545911 |
13 | b210058a185a |
14 | 4d20212cb429 |
15 | 24a3aec99e51 |
hex | 1230a3a4b6dd |
20000113211101 has 4 divisors (see below), whose sum is σ = 20000477520352. Its totient is φ = 19999748901852.
The previous prime is 20000113211017. The next prime is 20000113211147. The reversal of 20000113211101 is 10111231100002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20000113211101 - 217 = 20000113080029 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 (20000113211171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182072265 + ... + 182182078.
It is an arithmetic number, because the mean of its divisors is an integer number (5000119380088).
Almost surely, 220000113211101 is an apocalyptic number.
It is an amenable number.
20000113211101 is a deficient number, since it is larger than the sum of its proper divisors (364309251).
20000113211101 is an equidigital number, since it uses as much as digits as its factorization.
20000113211101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364309250.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 20000113211101 its reverse (10111231100002), we get a palindrome (30111344311103).
The spelling of 20000113211101 in words is "twenty trillion, one hundred thirteen million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •