Base | Representation |
---|---|
bin | 101101011110011001101111… |
… | …101000100010011000111011 |
3 | 222020010221100212110011110021 |
4 | 231132121233220202120323 |
5 | 202203310200410100011 |
6 | 1545211201001431311 |
7 | 60061422104206243 |
oct | 5536315750423073 |
9 | 866127325404407 |
10 | 200001320003131 |
11 | 587aa0a1133229 |
12 | 1a52171949b537 |
13 | 877a0748ab81a |
14 | 3756189070b23 |
15 | 181c75edd1471 |
hex | b5e66fa2263b |
200001320003131 has 8 divisors (see below), whose sum is σ = 203575571112960. Its totient is φ = 196433215501032.
The previous prime is 200001320003083. The next prime is 200001320003143. The reversal of 200001320003131 is 131300023100002.
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 200001320003131 - 229 = 200000783132219 is a prime.
It is a super-2 number, since 2×2000013200031312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200001320009131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1536586275 + ... + 1536716428.
It is an arithmetic number, because the mean of its divisors is an integer number (25446946389120).
Almost surely, 2200001320003131 is an apocalyptic number.
200001320003131 is a deficient number, since it is larger than the sum of its proper divisors (3574251109829).
200001320003131 is a wasteful number, since it uses less digits than its factorization.
200001320003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3073303865.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 200001320003131 its reverse (131300023100002), we get a palindrome (331301343103133).
The spelling of 200001320003131 in words is "two hundred trillion, one billion, three hundred twenty million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •