Base | Representation |
---|---|
bin | 101101100000001010001000… |
… | …101110101001110100100001 |
3 | 222020120110212021101100102220 |
4 | 231200022020232221310201 |
5 | 202212244324012333441 |
6 | 1545342435551301253 |
7 | 60103223502245031 |
oct | 5540121056516441 |
9 | 866513767340386 |
10 | 200122000121121 |
11 | 58846299998031 |
12 | 1a540b98b1a829 |
13 | 8788567963770 |
14 | 375bd568578c1 |
15 | 182097492d466 |
hex | b60288ba9d21 |
200122000121121 has 8 divisors (see below), whose sum is σ = 287354666840640. Its totient is φ = 123152000074512.
The previous prime is 200122000121107. The next prime is 200122000121123. The reversal of 200122000121121 is 121121000221002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200122000121121 - 213 = 200122000112929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200122000121121.
It is not an unprimeable number, because it can be changed into a prime (200122000121123) 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, 2565666668181 + ... + 2565666668258.
It is an arithmetic number, because the mean of its divisors is an integer number (35919333355080).
Almost surely, 2200122000121121 is an apocalyptic number.
It is an amenable number.
200122000121121 is a deficient number, since it is larger than the sum of its proper divisors (87232666719519).
200122000121121 is a wasteful number, since it uses less digits than its factorization.
200122000121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5131333336455.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200122000121121 its reverse (121121000221002), we get a palindrome (321243000342123).
The spelling of 200122000121121 in words is "two hundred trillion, one hundred twenty-two billion, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •