Base | Representation |
---|---|
bin | 1011101001110100001… |
… | …1000110001101100011 |
3 | 201010202111212221101002 |
4 | 2322131003012031203 |
5 | 11240004023033103 |
6 | 231545552102215 |
7 | 20315140142006 |
oct | 2723503061543 |
9 | 633674787332 |
10 | 200203330403 |
11 | 779a661935a |
12 | 3297383496b |
13 | 15b574a131b |
14 | 99930cd53d |
15 | 531b23a488 |
hex | 2e9d0c6363 |
200203330403 has 8 divisors (see below), whose sum is σ = 203315675472. Its totient is φ = 197094639456.
The previous prime is 200203330367. The next prime is 200203330409. The reversal of 200203330403 is 304033302002.
200203330403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200203330403 - 218 = 200203068259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200203330409) 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 7 ways as a sum of consecutive naturals, for example, 803000 + ... + 1022357.
It is an arithmetic number, because the mean of its divisors is an integer number (25414459434).
Almost surely, 2200203330403 is an apocalyptic number.
200203330403 is a deficient number, since it is larger than the sum of its proper divisors (3112345069).
200203330403 is a wasteful number, since it uses less digits than its factorization.
200203330403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1827061.
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 200203330403 its reverse (304033302002), we get a palindrome (504236632405).
The spelling of 200203330403 in words is "two hundred billion, two hundred three million, three hundred thirty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •