Base | Representation |
---|---|
bin | 1011101001111010111… |
… | …1001100000101101111 |
3 | 201010211111012112112210 |
4 | 2322132233030011233 |
5 | 11240033301303111 |
6 | 231552443301503 |
7 | 20315633036115 |
oct | 2723657140557 |
9 | 633744175483 |
10 | 200231666031 |
11 | 77a10612331 |
12 | 3298121a893 |
13 | 15b60312877 |
14 | 9996b87ab5 |
15 | 531d9860a6 |
hex | 2e9ebcc16f |
200231666031 has 16 divisors (see below), whose sum is σ = 275616266240. Its totient is φ = 129168315360.
The previous prime is 200231666017. The next prime is 200231666051. The reversal of 200231666031 is 130666132002.
It is not a de Polignac number, because 200231666031 - 25 = 200231665999 is a prime.
It is a super-2 number, since 2×2002316660312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200231666031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200231666051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 831990 + ... + 1045308.
It is an arithmetic number, because the mean of its divisors is an integer number (17226016640).
Almost surely, 2200231666031 is an apocalyptic number.
200231666031 is a deficient number, since it is larger than the sum of its proper divisors (75384600209).
200231666031 is a wasteful number, since it uses less digits than its factorization.
200231666031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223446.
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 200231666031 its reverse (130666132002), we get a palindrome (330897798033).
The spelling of 200231666031 in words is "two hundred billion, two hundred thirty-one million, six hundred sixty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •