Base | Representation |
---|---|
bin | 11110111000011101000… |
… | …010011000111101011011 |
3 | 21111212202211121100120211 |
4 | 132320131002120331123 |
5 | 234232231424310021 |
6 | 4302531540431551 |
7 | 306216055644205 |
oct | 36703502307533 |
9 | 7455684540524 |
10 | 2122201010011 |
11 | 749025165345 |
12 | 2a33689a85b7 |
13 | 125179744a14 |
14 | 74a02257775 |
15 | 3a30b2ee3e1 |
hex | 1ee1d098f5b |
2122201010011 has 8 divisors (see below), whose sum is σ = 2134030972304. Its totient is φ = 2110402978560.
The previous prime is 2122201009979. The next prime is 2122201010029. The reversal of 2122201010011 is 1100101022212.
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 2122201010011 - 25 = 2122201009979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2122201009973 and 2122201010000.
It is not an unprimeable number, because it can be changed into a prime (2122201010411) 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, 7849410 + ... + 8115271.
It is an arithmetic number, because the mean of its divisors is an integer number (266753871538).
Almost surely, 22122201010011 is an apocalyptic number.
2122201010011 is a deficient number, since it is larger than the sum of its proper divisors (11829962293).
2122201010011 is a wasteful number, since it uses less digits than its factorization.
2122201010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15965421.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2122201010011 its reverse (1100101022212), we get a palindrome (3222302032223).
The spelling of 2122201010011 in words is "two trillion, one hundred twenty-two billion, two hundred one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.354 sec. • engine limits •