Base | Representation |
---|---|
bin | 101101011110101011001001… |
… | …000011011111010110110001 |
3 | 222020012201120201100220201021 |
4 | 231132223021003133112301 |
5 | 202204111430012010001 |
6 | 1545223530341135441 |
7 | 60062653031410231 |
oct | 5536531103372661 |
9 | 866181521326637 |
10 | 200020000110001 |
11 | 58807007607a85 |
12 | 1a5252713ba581 |
13 | 877ba609a48b6 |
14 | 375703bd37cc1 |
15 | 181cea4d2cba1 |
hex | b5eac90df5b1 |
200020000110001 has 4 divisors (see below), whose sum is σ = 200742093973492. Its totient is φ = 199297906246512.
The previous prime is 200020000109989. The next prime is 200020000110043. The reversal of 200020000110001 is 100011000020002.
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 103191546488976 + 96828453621025 = 10158324^2 + 9840145^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200020000110001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200020000113001) 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, 361046931330 + ... + 361046931883.
It is an arithmetic number, because the mean of its divisors is an integer number (50185523493373).
Almost surely, 2200020000110001 is an apocalyptic number.
It is an amenable number.
200020000110001 is a deficient number, since it is larger than the sum of its proper divisors (722093863491).
200020000110001 is an equidigital number, since it uses as much as digits as its factorization.
200020000110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722093863490.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 200020000110001 its reverse (100011000020002), we get a palindrome (300031000130003).
The spelling of 200020000110001 in words is "two hundred trillion, twenty billion, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •