Base | Representation |
---|---|
bin | 101101100001011101001000… |
… | …110000100101101110000101 |
3 | 222020212222220021102020110022 |
4 | 231201131020300211232011 |
5 | 202220224334011400010 |
6 | 1545451415213304525 |
7 | 60112530140024246 |
oct | 5541351060455605 |
9 | 866788807366408 |
10 | 200211121200005 |
11 | 58880072473733 |
12 | 1a55630b495145 |
13 | 8793a9b65c876 |
14 | 37623acb24ccd |
15 | 1822e3da43d55 |
hex | b61748c25b85 |
200211121200005 has 4 divisors (see below), whose sum is σ = 240253345440012. Its totient is φ = 160168896960000.
The previous prime is 200211121199989. The next prime is 200211121200023. The reversal of 200211121200005 is 500002121112002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 99757287452449 + 100453833747556 = 9987857^2 + 10022666^2 .
It is not a de Polignac number, because 200211121200005 - 24 = 200211121199989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20021112119996 + ... + 20021112120005.
It is an arithmetic number, because the mean of its divisors is an integer number (60063336360003).
Almost surely, 2200211121200005 is an apocalyptic number.
It is an amenable number.
200211121200005 is a deficient number, since it is larger than the sum of its proper divisors (40042224240007).
200211121200005 is an equidigital number, since it uses as much as digits as its factorization.
200211121200005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40042224240006.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 200211121200005 its reverse (500002121112002), we get a palindrome (700213242312007).
The spelling of 200211121200005 in words is "two hundred trillion, two hundred eleven billion, one hundred twenty-one million, two hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •