Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …0101010100100000011 |
3 | 201010202100201122021102 |
4 | 2322130322222210003 |
5 | 11240002441320003 |
6 | 231545432445015 |
7 | 20315112304463 |
oct | 2723472524403 |
9 | 633670648242 |
10 | 200201120003 |
11 | 779a5349685 |
12 | 32972b4976b |
13 | 15b56ba91b1 |
14 | 9992ab5ba3 |
15 | 531ae50588 |
hex | 2e9ceaa903 |
200201120003 has 4 divisors (see below), whose sum is σ = 200204971800. Its totient is φ = 200197268208.
The previous prime is 200201119991. The next prime is 200201120017. The reversal of 200201120003 is 300021102002.
It is a happy number.
200201120003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200201120003 - 226 = 200134011139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200201120023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1846853 + ... + 1952246.
It is an arithmetic number, because the mean of its divisors is an integer number (50051242950).
Almost surely, 2200201120003 is an apocalyptic number.
200201120003 is a deficient number, since it is larger than the sum of its proper divisors (3851797).
200201120003 is an equidigital number, since it uses as much as digits as its factorization.
200201120003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3851796.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 200201120003 its reverse (300021102002), we get a palindrome (500222222005).
The spelling of 200201120003 in words is "two hundred billion, two hundred one million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •