Base | Representation |
---|---|
bin | 1011101010001011101… |
… | …1111111011110111011 |
3 | 201011000101210112111022 |
4 | 2322202323333132323 |
5 | 11240204321144011 |
6 | 232003441453055 |
7 | 20320450010534 |
oct | 2724273773673 |
9 | 634011715438 |
10 | 200302131131 |
11 | 77a47370853 |
12 | 329a094118b |
13 | 15b71ab4cab |
14 | 99a228b68b |
15 | 5324c548db |
hex | 2ea2eff7bb |
200302131131 has 4 divisors (see below), whose sum is σ = 207209101200. Its totient is φ = 193395161064.
The previous prime is 200302131119. The next prime is 200302131157. The reversal of 200302131131 is 131131203002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200302131131 - 26 = 200302131067 is a prime.
It is a super-2 number, since 2×2003021311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200302136131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3453484991 + ... + 3453485048.
It is an arithmetic number, because the mean of its divisors is an integer number (51802275300).
Almost surely, 2200302131131 is an apocalyptic number.
200302131131 is a deficient number, since it is larger than the sum of its proper divisors (6906970069).
200302131131 is an equidigital number, since it uses as much as digits as its factorization.
200302131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6906970068.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 200302131131 its reverse (131131203002), we get a palindrome (331433334133).
The spelling of 200302131131 in words is "two hundred billion, three hundred two million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •