Base | Representation |
---|---|
bin | 101101100000011100111000… |
… | …101100111100101010011101 |
3 | 222020122101211022200200120210 |
4 | 231200130320230330222131 |
5 | 202213112041334130323 |
6 | 1545400005402403033 |
7 | 60104535421234650 |
oct | 5540347054745235 |
9 | 866571738620523 |
10 | 200142132333213 |
11 | 58853890009a44 |
12 | 1a544a77200479 |
13 | 878a42584c9b5 |
14 | 375cd06517897 |
15 | 18212520b3293 |
hex | b60738b3ca9d |
200142132333213 has 8 divisors (see below), whose sum is σ = 304978487364928. Its totient is φ = 114366932761824.
The previous prime is 200142132333211. The next prime is 200142132333287. The reversal of 200142132333213 is 312333231241002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200142132333213 - 21 = 200142132333211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200142132333211) 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, 4765288865056 + ... + 4765288865097.
It is an arithmetic number, because the mean of its divisors is an integer number (38122310920616).
Almost surely, 2200142132333213 is an apocalyptic number.
It is an amenable number.
200142132333213 is a deficient number, since it is larger than the sum of its proper divisors (104836355031715).
200142132333213 is an equidigital number, since it uses as much as digits as its factorization.
200142132333213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9530577730163.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 200142132333213 its reverse (312333231241002), we get a palindrome (512475363574215).
The spelling of 200142132333213 in words is "two hundred trillion, one hundred forty-two billion, one hundred thirty-two million, three hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •