Base | Representation |
---|---|
bin | 11011010101010011001101… |
… | …111101110000111100101001 |
3 | 120202122001121021212211101202 |
4 | 123111103031331300330221 |
5 | 111224014112022413001 |
6 | 1103400100543253545 |
7 | 34214646435252053 |
oct | 3325231575607451 |
9 | 522561537784352 |
10 | 120211000201001 |
11 | 353372207a0216 |
12 | 115958448aa2b5 |
13 | 520cb05713b08 |
14 | 219835a0748d3 |
15 | dd6e6d6a896b |
hex | 6d54cdf70f29 |
120211000201001 has 4 divisors (see below), whose sum is σ = 120271498944912. Its totient is φ = 120150501457092.
The previous prime is 120211000200971. The next prime is 120211000201063. The reversal of 120211000201001 is 100102000112021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120211000201001 - 230 = 120209926459177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120211000201091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30249368975 + ... + 30249372948.
It is an arithmetic number, because the mean of its divisors is an integer number (30067874736228).
Almost surely, 2120211000201001 is an apocalyptic number.
It is an amenable number.
120211000201001 is a deficient number, since it is larger than the sum of its proper divisors (60498743911).
120211000201001 is an equidigital number, since it uses as much as digits as its factorization.
120211000201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60498743910.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120211000201001 its reverse (100102000112021), we get a palindrome (220313000313022).
The spelling of 120211000201001 in words is "one hundred twenty trillion, two hundred eleven billion, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •