Base | Representation |
---|---|
bin | 101101100000001001011001… |
… | …101001011000101011000101 |
3 | 222020120101211020000202110222 |
4 | 231200021121221120223011 |
5 | 202212241214303223023 |
6 | 1545342225332554125 |
7 | 60103165101154100 |
oct | 5540113151305305 |
9 | 866511736022428 |
10 | 200121210211013 |
11 | 58845a24018963 |
12 | 1a5409b8482945 |
13 | 8788470104330 |
14 | 375bcbd997737 |
15 | 182092a3eacc8 |
hex | b60259a58ac5 |
200121210211013 has 48 divisors (see below), whose sum is σ = 251332499234880. Its totient is φ = 157939234677504.
The previous prime is 200121210210983. The next prime is 200121210211019. The reversal of 200121210211013 is 310112012121002.
It is a happy number.
It is not a de Polignac number, because 200121210211013 - 26 = 200121210210949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200121210210982 and 200121210211000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200121210211019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 897377558 + ... + 897600536.
It is an arithmetic number, because the mean of its divisors is an integer number (5236093734060).
Almost surely, 2200121210211013 is an apocalyptic number.
It is an amenable number.
200121210211013 is a deficient number, since it is larger than the sum of its proper divisors (51211289023867).
200121210211013 is a wasteful number, since it uses less digits than its factorization.
200121210211013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226546 (or 226539 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 200121210211013 its reverse (310112012121002), we get a palindrome (510233222332015).
The spelling of 200121210211013 in words is "two hundred trillion, one hundred twenty-one billion, two hundred ten million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •