Base | Representation |
---|---|
bin | 1001010100011101100… |
… | …01110110000011001101 |
3 | 1010121112220002102121022 |
4 | 10222032301312003031 |
5 | 20221304042323041 |
6 | 403035230243525 |
7 | 32064265453214 |
oct | 4521661660315 |
9 | 1117486072538 |
10 | 320223011021 |
11 | 1138955a5851 |
12 | 5208a0565a5 |
13 | 24273789614 |
14 | 116dacba07b |
15 | 84e2ccc24b |
hex | 4a8ec760cd |
320223011021 has 4 divisors (see below), whose sum is σ = 320239761600. Its totient is φ = 320206260444.
The previous prime is 320223010973. The next prime is 320223011023. The reversal of 320223011021 is 120110322023.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-320223011021 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 (320223011023) 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 3 ways as a sum of consecutive naturals, for example, 8346581 + ... + 8384858.
It is an arithmetic number, because the mean of its divisors is an integer number (80059940400).
Almost surely, 2320223011021 is an apocalyptic number.
It is an amenable number.
320223011021 is a deficient number, since it is larger than the sum of its proper divisors (16750579).
320223011021 is a wasteful number, since it uses less digits than its factorization.
320223011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16750578.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 320223011021 its reverse (120110322023), we get a palindrome (440333333044).
The spelling of 320223011021 in words is "three hundred twenty billion, two hundred twenty-three million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •