Base | Representation |
---|---|
bin | 1001001100100010101000… |
… | …11001111101101100011011 |
3 | 2122121012211110102102112102 |
4 | 10212101110121331230123 |
5 | 10122304401230401021 |
6 | 111001525322034015 |
7 | 4155000015634265 |
oct | 446212431755433 |
9 | 78535743372472 |
10 | 20222122122011 |
11 | 64971768259a7 |
12 | 232722394890b |
13 | b38c26842924 |
14 | 4dca823ccb35 |
15 | 25105550d00b |
hex | 12645467db1b |
20222122122011 has 8 divisors (see below), whose sum is σ = 21310269031584. Its totient is φ = 19151385563200.
The previous prime is 20222122122001. The next prime is 20222122122079. The reversal of 20222122122011 is 11022122122202.
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 20222122122011 - 210 = 20222122120987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20222122122001) 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, 4352585306 + ... + 4352589951.
It is an arithmetic number, because the mean of its divisors is an integer number (2663783628948).
Almost surely, 220222122122011 is an apocalyptic number.
20222122122011 is a deficient number, since it is larger than the sum of its proper divisors (1088146909573).
20222122122011 is a wasteful number, since it uses less digits than its factorization.
20222122122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8705175381.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20222122122011 its reverse (11022122122202), we get a palindrome (31244244244213).
The spelling of 20222122122011 in words is "twenty trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •