Base | Representation |
---|---|
bin | 11011010011111111100000… |
… | …001010000110001000111001 |
3 | 120202022110120202200220002120 |
4 | 123103333200022012020321 |
5 | 111221031013421011301 |
6 | 1103250513204151453 |
7 | 34205315053504665 |
oct | 3323774012061071 |
9 | 522273522626076 |
10 | 120121111110201 |
11 | 35302093741923 |
12 | 11580339098589 |
13 | 52044ab8849a6 |
14 | 2193c6dba78a5 |
15 | dd495be38e36 |
hex | 6d3fe0286239 |
120121111110201 has 8 divisors (see below), whose sum is σ = 160206635563104. Its totient is φ = 80058163698720.
The previous prime is 120121111110173. The next prime is 120121111110223. The reversal of 120121111110201 is 102011111121021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120121111110201 - 29 = 120121111109689 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120121111100201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5644247940 + ... + 5644269221.
It is an arithmetic number, because the mean of its divisors is an integer number (20025829445388).
Almost surely, 2120121111110201 is an apocalyptic number.
It is an amenable number.
120121111110201 is a deficient number, since it is larger than the sum of its proper divisors (40085524452903).
120121111110201 is a wasteful number, since it uses less digits than its factorization.
120121111110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11288520711.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 120121111110201 its reverse (102011111121021), we get a palindrome (222132222231222).
The spelling of 120121111110201 in words is "one hundred twenty trillion, one hundred twenty-one billion, one hundred eleven million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •