Base | Representation |
---|---|
bin | 1011101001000110111… |
… | …0010001000010001011 |
3 | 201010021021100102120000 |
4 | 2322101232101002023 |
5 | 11234111402222311 |
6 | 231515043334043 |
7 | 20310342112536 |
oct | 2722156210213 |
9 | 633237312500 |
10 | 200013320331 |
11 | 77909339a40 |
12 | 32920081323 |
13 | 15b27004126 |
14 | 9975b8ba1d |
15 | 5309706056 |
hex | 2e91b9108b |
200013320331 has 40 divisors (see below), whose sum is σ = 326014818624. Its totient is φ = 121195208880.
The previous prime is 200013320257. The next prime is 200013320341. The reversal of 200013320331 is 133023310002.
200013320331 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 1 + 332 + 0 + 331 = 666.
It is not a de Polignac number, because 200013320331 - 227 = 199879102603 is a prime.
It is a super-2 number, since 2×2000133203312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200013320341) 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 39 ways as a sum of consecutive naturals, for example, 4886356 + ... + 4927118.
Almost surely, 2200013320331 is an apocalyptic number.
200013320331 is a deficient number, since it is larger than the sum of its proper divisors (126001498293).
200013320331 is a wasteful number, since it uses less digits than its factorization.
200013320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46293 (or 46284 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 200013320331 its reverse (133023310002), we get a palindrome (333036630333).
It can be divided in two parts, 2000 and 13320331, that added together give a palindrome (13322331).
The spelling of 200013320331 in words is "two hundred billion, thirteen million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •