Base | Representation |
---|---|
bin | 10010111011010010… |
… | …101100111100000001 |
3 | 1221110021122012210102 |
4 | 102323102230330001 |
5 | 313104430024413 |
6 | 13200313212145 |
7 | 1316413044464 |
oct | 227322547401 |
9 | 57407565712 |
10 | 20322111233 |
11 | 8689335a56 |
12 | 3b31a01055 |
13 | 1bbb347ab8 |
14 | daadb32db |
15 | 7de196458 |
hex | 4bb4acf01 |
20322111233 has 8 divisors (see below), whose sum is σ = 20791475496. Its totient is φ = 19855929600.
The previous prime is 20322111203. The next prime is 20322111239. The reversal of 20322111233 is 33211122302.
It can be written as a sum of positive squares in 4 ways, for example, as 14538812929 + 5783298304 = 120577^2 + 76048^2 .
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 20322111233 - 26 = 20322111169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20322111239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 782738 + ... + 808283.
It is an arithmetic number, because the mean of its divisors is an integer number (2598934437).
Almost surely, 220322111233 is an apocalyptic number.
It is an amenable number.
20322111233 is a deficient number, since it is larger than the sum of its proper divisors (469364263).
20322111233 is a wasteful number, since it uses less digits than its factorization.
20322111233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591315.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20322111233 its reverse (33211122302), we get a palindrome (53533233535).
The spelling of 20322111233 in words is "twenty billion, three hundred twenty-two million, one hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •