Base | Representation |
---|---|
bin | 101101011110101011010000… |
… | …001101100110011110100001 |
3 | 222020012201220002100011202112 |
4 | 231132223100031212132201 |
5 | 202204112201232413441 |
6 | 1545223550311125105 |
7 | 60062656020231143 |
oct | 5536532015463641 |
9 | 866181802304675 |
10 | 200020120201121 |
11 | 58807069381240 |
12 | 1a5252a5673795 |
13 | 877ba7c83112c |
14 | 375704dc78c93 |
15 | 181ceb06504eb |
hex | b5ead03667a1 |
200020120201121 has 8 divisors (see below), whose sum is σ = 218388529375488. Its totient is φ = 181682504674000.
The previous prime is 200020120201067. The next prime is 200020120201127. The reversal of 200020120201121 is 121102021020002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200020120201121 - 234 = 200002940331937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020120201096 and 200020120201105.
It is not an unprimeable number, because it can be changed into a prime (200020120201127) 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, 7698398225 + ... + 7698424206.
It is an arithmetic number, because the mean of its divisors is an integer number (27298566171936).
Almost surely, 2200020120201121 is an apocalyptic number.
It is an amenable number.
200020120201121 is a deficient number, since it is larger than the sum of its proper divisors (18368409174367).
200020120201121 is a wasteful number, since it uses less digits than its factorization.
200020120201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15396823623.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200020120201121 its reverse (121102021020002), we get a palindrome (321122141221123).
The spelling of 200020120201121 in words is "two hundred trillion, twenty billion, one hundred twenty million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •