Base | Representation |
---|---|
bin | 101101011110011011011001… |
… | …101111001100001100100011 |
3 | 222020011002221221002002100222 |
4 | 231132123121233030030203 |
5 | 202203322322113212011 |
6 | 1545212053352033255 |
7 | 60061514161102562 |
oct | 5536333157141443 |
9 | 866132857062328 |
10 | 200003100132131 |
11 | 587aa924a5551a |
12 | 1a521b3569282b |
13 | 877a2996320aa |
14 | 37562b7653bd9 |
15 | 181c816311ddb |
hex | b5e6d9bcc323 |
200003100132131 has 8 divisors (see below), whose sum is σ = 202112179562304. Its totient is φ = 197904592529280.
The previous prime is 200003100132053. The next prime is 200003100132191. The reversal of 200003100132131 is 131231001300002.
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 200003100132131 - 242 = 195605053621027 is a prime.
It is a super-2 number, since 2×2000031001321312 (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 (200003100132191) 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, 2642918795 + ... + 2642994468.
It is an arithmetic number, because the mean of its divisors is an integer number (25264022445288).
Almost surely, 2200003100132131 is an apocalyptic number.
200003100132131 is a deficient number, since it is larger than the sum of its proper divisors (2109079430173).
200003100132131 is a wasteful number, since it uses less digits than its factorization.
200003100132131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5285913661.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 200003100132131 its reverse (131231001300002), we get a palindrome (331234101432133).
The spelling of 200003100132131 in words is "two hundred trillion, three billion, one hundred million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •