Base | Representation |
---|---|
bin | 1010000010000011111011… |
… | …11000111100100010110111 |
3 | 2220010000110111012200001010 |
4 | 11001001331320330202313 |
5 | 10342422024403043221 |
6 | 114530413555003303 |
7 | 4434600506640630 |
oct | 501017570744267 |
9 | 86100414180033 |
10 | 22061064112311 |
11 | 7036054619244 |
12 | 25836b9899533 |
13 | c4047089c133 |
14 | 563a92a3a887 |
15 | 283cd3c0dc76 |
hex | 14107de3c8b7 |
22061064112311 has 8 divisors (see below), whose sum is σ = 33616859599744. Its totient is φ = 12606322349880.
The previous prime is 22061064112303. The next prime is 22061064112331. The reversal of 22061064112311 is 11321146016022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22061064112311 - 23 = 22061064112303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22061064112301) 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, 525263431225 + ... + 525263431266.
It is an arithmetic number, because the mean of its divisors is an integer number (4202107449968).
Almost surely, 222061064112311 is an apocalyptic number.
22061064112311 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22061064112311 is a deficient number, since it is larger than the sum of its proper divisors (11555795487433).
22061064112311 is a wasteful number, since it uses less digits than its factorization.
22061064112311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050526862501.
The product of its (nonzero) digits is 3456, while the sum is 30.
The spelling of 22061064112311 in words is "twenty-two trillion, sixty-one billion, sixty-four million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •