Base | Representation |
---|---|
bin | 1011101010001100000… |
… | …0001010000011110111 |
3 | 201011000110212000022001 |
4 | 2322203000022003313 |
5 | 11240210111114111 |
6 | 232003521120131 |
7 | 20320462206112 |
oct | 2724300120367 |
9 | 634013760261 |
10 | 200303223031 |
11 | 77a47a4714a |
12 | 329a1189047 |
13 | 15b720a7ca2 |
14 | 99a2493579 |
15 | 5324dbd1c1 |
hex | 2ea300a0f7 |
200303223031 has 8 divisors (see below), whose sum is σ = 201256833024. Its totient is φ = 199350238200.
The previous prime is 200303223011. The next prime is 200303223149. The reversal of 200303223031 is 130322303002.
It is a happy number.
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 200303223031 - 211 = 200303220983 is a prime.
It is a super-2 number, since 2×2003032230312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200303223011) 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 7 ways as a sum of consecutive naturals, for example, 492426 + ... + 801928.
It is an arithmetic number, because the mean of its divisors is an integer number (25157104128).
Almost surely, 2200303223031 is an apocalyptic number.
200303223031 is a deficient number, since it is larger than the sum of its proper divisors (953609993).
200303223031 is a wasteful number, since it uses less digits than its factorization.
200303223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312581.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 200303223031 its reverse (130322303002), we get a palindrome (330625526033).
The spelling of 200303223031 in words is "two hundred billion, three hundred three million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •