Base | Representation |
---|---|
bin | 1001001100100011000000… |
… | …10000101010101001101111 |
3 | 2122121020100022200001100210 |
4 | 10212101200100222221233 |
5 | 10122310303134330221 |
6 | 111002001144553503 |
7 | 4155004652314416 |
oct | 446214020525157 |
9 | 78536308601323 |
10 | 20222321011311 |
11 | 649726901a421 |
12 | 232727a482893 |
13 | b38c58acb4c3 |
14 | 4dcaa09a247d |
15 | 251067be8276 |
hex | 12646042aa6f |
20222321011311 has 8 divisors (see below), whose sum is σ = 28549159074864. Its totient is φ = 12688515144320.
The previous prime is 20222321011273. The next prime is 20222321011331. The reversal of 20222321011311 is 11311012322202.
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 20222321011311 - 217 = 20222320880239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222321011331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198258049080 + ... + 198258049181.
It is an arithmetic number, because the mean of its divisors is an integer number (3568644884358).
Almost surely, 220222321011311 is an apocalyptic number.
20222321011311 is a deficient number, since it is larger than the sum of its proper divisors (8326838063553).
20222321011311 is a wasteful number, since it uses less digits than its factorization.
20222321011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396516098281.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 20222321011311 its reverse (11311012322202), we get a palindrome (31533333333513).
The spelling of 20222321011311 in words is "twenty trillion, two hundred twenty-two billion, three hundred twenty-one million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •