Base | Representation |
---|---|
bin | 101101011111110101110000… |
… | …100100101100100000001001 |
3 | 222020111101101102010002200101 |
4 | 231133311300210230200021 |
5 | 202211420021211133001 |
6 | 1545324420501005401 |
7 | 60101520340412464 |
oct | 5537656044544011 |
9 | 866441342102611 |
10 | 200100120021001 |
11 | 58837a91174a62 |
12 | 1a5388b13b3861 |
13 | 878648b901c65 |
14 | 375ac7c9a82db |
15 | 18200e3ad5a01 |
hex | b5fd7092c809 |
200100120021001 has 8 divisors (see below), whose sum is σ = 213139402237440. Its totient is φ = 187201803018048.
The previous prime is 200100120020987. The next prime is 200100120021023. The reversal of 200100120021001 is 100120021001002.
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 200100120021001 - 213 = 200100120012809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200100120021101) 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, 35241300441 + ... + 35241306118.
It is an arithmetic number, because the mean of its divisors is an integer number (26642425279680).
Almost surely, 2200100120021001 is an apocalyptic number.
It is an amenable number.
200100120021001 is a deficient number, since it is larger than the sum of its proper divisors (13039282216439).
200100120021001 is a wasteful number, since it uses less digits than its factorization.
200100120021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70482606743.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200100120021001 its reverse (100120021001002), we get a palindrome (300220141022003).
The spelling of 200100120021001 in words is "two hundred trillion, one hundred billion, one hundred twenty million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.192 sec. • engine limits •