Base | Representation |
---|---|
bin | 101101011110011010011111… |
… | …111110100101000011001011 |
3 | 222020011000110101122112010102 |
4 | 231132122133332211003023 |
5 | 202203313331024300223 |
6 | 1545211413254040015 |
7 | 60061451153260010 |
oct | 5536323776450313 |
9 | 866130411575112 |
10 | 200002131087563 |
11 | 587aa477a54a42 |
12 | 1a52190504900b |
13 | 877a173942a3c |
14 | 3756224a83707 |
15 | 181c7ab1e7928 |
hex | b5e69ffa50cb |
200002131087563 has 64 divisors (see below), whose sum is σ = 242057938636800. Its totient is φ = 161429113036800.
The previous prime is 200002131087529. The next prime is 200002131087569. The reversal of 200002131087563 is 365780131200002.
It is not a de Polignac number, because 200002131087563 - 210 = 200002131086539 is a prime.
It is a super-3 number, since 3×2000021310875633 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (200002131087569) 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 63 ways as a sum of consecutive naturals, for example, 71403829763 + ... + 71403832563.
It is an arithmetic number, because the mean of its divisors is an integer number (3782155291200).
Almost surely, 2200002131087563 is an apocalyptic number.
200002131087563 is a deficient number, since it is larger than the sum of its proper divisors (42055807549237).
200002131087563 is a wasteful number, since it uses less digits than its factorization.
200002131087563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6252.
The product of its (nonzero) digits is 60480, while the sum is 38.
Adding to 200002131087563 its reverse (365780131200002), we get a palindrome (565782262287565).
The spelling of 200002131087563 in words is "two hundred trillion, two billion, one hundred thirty-one million, eighty-seven thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •