Base | Representation |
---|---|
bin | 1001000110101010110000… |
… | …10000100101110110101101 |
3 | 2121212220221202100200020202 |
4 | 10203111120100211312231 |
5 | 10111003110231423041 |
6 | 110325113133123245 |
7 | 4134264163224335 |
oct | 443253020456655 |
9 | 77786852320222 |
10 | 20020323311021 |
11 | 6419631642450 |
12 | 22b40a5929525 |
13 | b22ba695b967 |
14 | 4d2dbb4640c5 |
15 | 24ab941b7a9b |
hex | 123558425dad |
20020323311021 has 8 divisors (see below), whose sum is σ = 21849456672000. Its totient is φ = 18192707278240.
The previous prime is 20020323310973. The next prime is 20020323311033. The reversal of 20020323311021 is 12011332302002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20020323311021 - 26 = 20020323310957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020323310984 and 20020323311002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020323311041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379304456 + ... + 379357233.
It is an arithmetic number, because the mean of its divisors is an integer number (2731182084000).
Almost surely, 220020323311021 is an apocalyptic number.
It is an amenable number.
20020323311021 is a deficient number, since it is larger than the sum of its proper divisors (1829133360979).
20020323311021 is a wasteful number, since it uses less digits than its factorization.
20020323311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758664099.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20020323311021 its reverse (12011332302002), we get a palindrome (32031655613023).
The spelling of 20020323311021 in words is "twenty trillion, twenty billion, three hundred twenty-three million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •