Base | Representation |
---|---|
bin | 101101011110011001101111… |
… | …101000100100011101101111 |
3 | 222020010221100212110121010002 |
4 | 231132121233220210131233 |
5 | 202203310200410333011 |
6 | 1545211201001534515 |
7 | 60061422104243105 |
oct | 5536315750443557 |
9 | 866127325417102 |
10 | 200001320011631 |
11 | 587aa0a1139656 |
12 | 1a5217194a443b |
13 | 877a0748b2658 |
14 | 3756189073c75 |
15 | 181c75edd3c3b |
hex | b5e66fa2476f |
200001320011631 has 2 divisors, whose sum is σ = 200001320011632. Its totient is φ = 200001320011630.
The previous prime is 200001320011621. The next prime is 200001320011663. The reversal of 200001320011631 is 136110023100002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200001320011631 - 242 = 195603273500527 is a prime.
It is a super-2 number, since 2×2000013200116312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200001320011621) 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 as a sum of consecutive naturals, namely, 100000660005815 + 100000660005816.
It is an arithmetic number, because the mean of its divisors is an integer number (100000660005816).
Almost surely, 2200001320011631 is an apocalyptic number.
200001320011631 is a deficient number, since it is larger than the sum of its proper divisors (1).
200001320011631 is an equidigital number, since it uses as much as digits as its factorization.
200001320011631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 200001320011631 its reverse (136110023100002), we get a palindrome (336111343111633).
The spelling of 200001320011631 in words is "two hundred trillion, one billion, three hundred twenty million, eleven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •