Base | Representation |
---|---|
bin | 1011101010010010011… |
… | …0110011011001000011 |
3 | 201011002100111002002220 |
4 | 2322210212303121003 |
5 | 11240234003143021 |
6 | 232010321542123 |
7 | 20321240006043 |
oct | 2724446633103 |
9 | 634070432086 |
10 | 200330131011 |
11 | 77a6115554a |
12 | 329aa1a4943 |
13 | 15b7783977a |
14 | 99a5c99723 |
15 | 5327435cc6 |
hex | 2ea49b3643 |
200330131011 has 16 divisors (see below), whose sum is σ = 276632091648. Its totient is φ = 128870840000.
The previous prime is 200330130911. The next prime is 200330131013. The reversal of 200330131011 is 110131033002.
200330131011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200330131011 - 213 = 200330122819 is a prime.
It is a super-2 number, since 2×2003301310112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200330131013) 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 15 ways as a sum of consecutive naturals, for example, 9995490 + ... + 10015511.
It is an arithmetic number, because the mean of its divisors is an integer number (17289505728).
Almost surely, 2200330131011 is an apocalyptic number.
200330131011 is a deficient number, since it is larger than the sum of its proper divisors (76301960637).
200330131011 is a wasteful number, since it uses less digits than its factorization.
200330131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20011122.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 200330131011 its reverse (110131033002), we get a palindrome (310461164013).
The spelling of 200330131011 in words is "two hundred billion, three hundred thirty million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •