Base | Representation |
---|---|
bin | 1011101001100000010… |
… | …1100110100101010001 |
3 | 201010112201021110101001 |
4 | 2322120011212211101 |
5 | 11234321221214301 |
6 | 231533420142001 |
7 | 20313106536166 |
oct | 2723005464521 |
9 | 633481243331 |
10 | 200120101201 |
11 | 77963641a99 |
12 | 3294b997901 |
13 | 15b43180187 |
14 | 998602606d |
15 | 5313c99c01 |
hex | 2e98166951 |
200120101201 has 4 divisors (see below), whose sum is σ = 200203870900. Its totient is φ = 200036331504.
The previous prime is 200120101121. The next prime is 200120101273. The reversal of 200120101201 is 102101021002.
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 124010326801 + 76109774400 = 352151^2 + 275880^2 .
It is a cyclic number.
It is not a de Polignac number, because 200120101201 - 27 = 200120101073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200150101201) by changing a digit.
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, 41881266 + ... + 41886043.
It is an arithmetic number, because the mean of its divisors is an integer number (50050967725).
Almost surely, 2200120101201 is an apocalyptic number.
It is an amenable number.
200120101201 is a deficient number, since it is larger than the sum of its proper divisors (83769699).
200120101201 is an equidigital number, since it uses as much as digits as its factorization.
200120101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83769698.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200120101201 its reverse (102101021002), we get a palindrome (302221122203).
The spelling of 200120101201 in words is "two hundred billion, one hundred twenty million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •