Base | Representation |
---|---|
bin | 1001000111000001000110… |
… | …11100000011001100011011 |
3 | 2121221001220222001110102212 |
4 | 10203200203130003030123 |
5 | 10111202143414233334 |
6 | 110334415515145335 |
7 | 4135200420501431 |
oct | 443404334031433 |
9 | 77831828043385 |
10 | 20032322024219 |
11 | 64237295a524a |
12 | 22b649414524b |
13 | b2406976285b |
14 | 4d37d8c28d51 |
15 | 24b147781ece |
hex | 12382370331b |
20032322024219 has 4 divisors (see below), whose sum is σ = 20041341532080. Its totient is φ = 20023302516360.
The previous prime is 20032322024203. The next prime is 20032322024251. The reversal of 20032322024219 is 91242022323002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20032322024219 - 24 = 20032322024203 is a prime.
It is a super-2 number, since 2×200323220242192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20032322324219) 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, 4509750599 + ... + 4509755040.
It is an arithmetic number, because the mean of its divisors is an integer number (5010335383020).
Almost surely, 220032322024219 is an apocalyptic number.
20032322024219 is a deficient number, since it is larger than the sum of its proper divisors (9019507861).
20032322024219 is an equidigital number, since it uses as much as digits as its factorization.
20032322024219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9019507860.
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 20032322024219 in words is "twenty trillion, thirty-two billion, three hundred twenty-two million, twenty-four thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •