Base | Representation |
---|---|
bin | 11011110000110010101011… |
… | …000111101001110101110011 |
3 | 121000022122221221212022001112 |
4 | 123300302223013221311303 |
5 | 112000442203001413021 |
6 | 1111404020313223535 |
7 | 34501306544636465 |
oct | 3360625307516563 |
9 | 530278857768045 |
10 | 122100201201011 |
11 | 359a544a483420 |
12 | 1183ba06401bab |
13 | 5318ccc088617 |
14 | 2221977596135 |
15 | e1b18e362d5b |
hex | 6f0cab1e9d73 |
122100201201011 has 8 divisors (see below), whose sum is σ = 133300596463104. Its totient is φ = 110916535434120.
The previous prime is 122100201200977. The next prime is 122100201201023. The reversal of 122100201201011 is 110102102001221.
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 122100201201011 - 214 = 122100201184627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122100201701011) 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, 4182358535 + ... + 4182387728.
It is an arithmetic number, because the mean of its divisors is an integer number (16662574557888).
Almost surely, 2122100201201011 is an apocalyptic number.
122100201201011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122100201201011 is a deficient number, since it is larger than the sum of its proper divisors (11200395262093).
122100201201011 is a wasteful number, since it uses less digits than its factorization.
122100201201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8364747601.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122100201201011 its reverse (110102102001221), we get a palindrome (232202303202232).
The spelling of 122100201201011 in words is "one hundred twenty-two trillion, one hundred billion, two hundred one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •