Base | Representation |
---|---|
bin | 1001000110000101001000… |
… | …00111010110010101111001 |
3 | 2121210222210211101001020011 |
4 | 10203002210013112111321 |
5 | 10110140222001320441 |
6 | 110311532342101521 |
7 | 4132650434356522 |
oct | 443024407262571 |
9 | 77728724331204 |
10 | 20000121120121 |
11 | 6411004a7440a |
12 | 22b01a811a8a1 |
13 | b2100741074c |
14 | 4d2022389849 |
15 | 24a3b080d581 |
hex | 1230a41d6579 |
20000121120121 has 8 divisors (see below), whose sum is σ = 20150600468544. Its totient is φ = 19850081128560.
The previous prime is 20000121120071. The next prime is 20000121120149. The reversal of 20000121120121 is 12102112100002.
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 20000121120121 - 227 = 19999986902393 is a prime.
It is a super-2 number, since 2×200001211201212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20000121124121) 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, 109747831 + ... + 109929916.
It is an arithmetic number, because the mean of its divisors is an integer number (2518825058568).
Almost surely, 220000121120121 is an apocalyptic number.
It is an amenable number.
20000121120121 is a deficient number, since it is larger than the sum of its proper divisors (150479348423).
20000121120121 is a wasteful number, since it uses less digits than its factorization.
20000121120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219678431.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20000121120121 its reverse (12102112100002), we get a palindrome (32102233220123).
The spelling of 20000121120121 in words is "twenty trillion, one hundred twenty-one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •