Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111010010100000011001111 |
3 | 222020212220112010220100100210 |
4 | 231201130101322110003033 |
5 | 202220220442424032231 |
6 | 1545451144022253503 |
7 | 60112465264333632 |
oct | 5541342172240317 |
9 | 866786463810323 |
10 | 200210201002191 |
11 | 5887a73aaa6476 |
12 | 1a5560b3287293 |
13 | 8793982b13a13 |
14 | 376232282bc19 |
15 | 1822dd7d77a46 |
hex | b61711e940cf |
200210201002191 has 8 divisors (see below), whose sum is σ = 268438258327680. Its totient is φ = 132727805505752.
The previous prime is 200210201002093. The next prime is 200210201002283. The reversal of 200210201002191 is 191200102012002.
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 200210201002191 - 215 = 200210200969423 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210201002391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 186415456635 + ... + 186415457708.
It is an arithmetic number, because the mean of its divisors is an integer number (33554782290960).
Almost surely, 2200210201002191 is an apocalyptic number.
200210201002191 is a deficient number, since it is larger than the sum of its proper divisors (68228057325489).
200210201002191 is a wasteful number, since it uses less digits than its factorization.
200210201002191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372830914525.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 200210201002191 its reverse (191200102012002), we get a palindrome (391410303014193).
The spelling of 200210201002191 in words is "two hundred trillion, two hundred ten billion, two hundred one million, two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •