Base | Representation |
---|---|
bin | 101101011110011001101111… |
… | …000010011010111110100111 |
3 | 222020010221100011122112020120 |
4 | 231132121233002122332213 |
5 | 202203310140330330203 |
6 | 1545211200003333023 |
7 | 60061421623242453 |
oct | 5536315702327647 |
9 | 866127304575216 |
10 | 200001310011303 |
11 | 587aa096529219 |
12 | 1a521716081173 |
13 | 877a0727c08b8 |
14 | 37561879cd663 |
15 | 181c75e0aab53 |
hex | b5e66f09afa7 |
200001310011303 has 16 divisors (see below), whose sum is σ = 287550022099200. Its totient is φ = 123235723753920.
The previous prime is 200001310011281. The next prime is 200001310011323. The reversal of 200001310011303 is 303110013100002.
It is not a de Polignac number, because 200001310011303 - 214 = 200001309994919 is a prime.
It is a super-2 number, since 2×2000013100113032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001310011323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42790179523 + ... + 42790184196.
It is an arithmetic number, because the mean of its divisors is an integer number (17971876381200).
Almost surely, 2200001310011303 is an apocalyptic number.
200001310011303 is a deficient number, since it is larger than the sum of its proper divisors (87548712087897).
200001310011303 is a wasteful number, since it uses less digits than its factorization.
200001310011303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85580363782.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 200001310011303 its reverse (303110013100002), we get a palindrome (503111323111305).
The spelling of 200001310011303 in words is "two hundred trillion, one billion, three hundred ten million, eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •