Base | Representation |
---|---|
bin | 11011110010001111101000… |
… | …110101111110011100011011 |
3 | 121000200012121120102120202012 |
4 | 123302033220311332130123 |
5 | 112004111120334031021 |
6 | 1111521525322100135 |
7 | 34511442303150461 |
oct | 3362175065763433 |
9 | 530605546376665 |
10 | 122200021002011 |
11 | 35a33813120327 |
12 | 1185722394a64b |
13 | 5325549454724 |
14 | 222672670a831 |
15 | e1da8285535b |
hex | 6f23e8d7e71b |
122200021002011 has 4 divisors (see below), whose sum is σ = 122236706691624. Its totient is φ = 122163335312400.
The previous prime is 122200021002001. The next prime is 122200021002049. The reversal of 122200021002011 is 110200120002221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122200021002011 - 210 = 122200021000987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122200021002001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18342839810 + ... + 18342846471.
It is an arithmetic number, because the mean of its divisors is an integer number (30559176672906).
Almost surely, 2122200021002011 is an apocalyptic number.
122200021002011 is a deficient number, since it is larger than the sum of its proper divisors (36685689613).
122200021002011 is an equidigital number, since it uses as much as digits as its factorization.
122200021002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36685689612.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122200021002011 its reverse (110200120002221), we get a palindrome (232400141004232).
The spelling of 122200021002011 in words is "one hundred twenty-two trillion, two hundred billion, twenty-one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •