Base | Representation |
---|---|
bin | 11011100000110010001110… |
… | …000000010111000011011011 |
3 | 120212102111200001122111221212 |
4 | 123200302032000113003123 |
5 | 111324431402441401021 |
6 | 1105202420334053335 |
7 | 34325655532352561 |
oct | 3340621600270333 |
9 | 525374601574855 |
10 | 121000201122011 |
11 | 35610996079042 |
12 | 116a279664a24b |
13 | 5269368283403 |
14 | 21c46260aba31 |
15 | dec75d89885b |
hex | 6e0c8e0170db |
121000201122011 has 8 divisors (see below), whose sum is σ = 121311711275040. Its totient is φ = 120688693306432.
The previous prime is 121000201121953. The next prime is 121000201122013. The reversal of 121000201122011 is 110221102000121.
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 121000201122011 - 226 = 121000134013147 is a prime.
It is a super-2 number, since 2×1210002011220112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121000201122013) 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, 159263906 + ... + 160021848.
It is an arithmetic number, because the mean of its divisors is an integer number (15163963909380).
Almost surely, 2121000201122011 is an apocalyptic number.
121000201122011 is a deficient number, since it is larger than the sum of its proper divisors (311510153029).
121000201122011 is an equidigital number, since it uses as much as digits as its factorization.
121000201122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168725.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121000201122011 its reverse (110221102000121), we get a palindrome (231221303122132).
The spelling of 121000201122011 in words is "one hundred twenty-one trillion, two hundred one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •