Base | Representation |
---|---|
bin | 10010101000001110… |
… | …110000101101101101 |
3 | 1220121222212200101010 |
4 | 102220032300231231 |
5 | 311431042423041 |
6 | 13104450535433 |
7 | 1305450560400 |
oct | 225016605555 |
9 | 56558780333 |
10 | 20002311021 |
11 | 8534868360 |
12 | 3a62897579 |
13 | 1b6a0067c4 |
14 | d7a727d37 |
15 | 7c1075a16 |
hex | 4a83b0b6d |
20002311021 has 48 divisors (see below), whose sum is σ = 33919034688. Its totient is φ = 10367884800.
The previous prime is 20002310987. The next prime is 20002311059. The reversal of 20002311021 is 12011320002.
It is not a de Polignac number, because 20002311021 - 213 = 20002302829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20002310988 and 20002311006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002311221) 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 47 ways as a sum of consecutive naturals, for example, 732021 + ... + 758853.
It is an arithmetic number, because the mean of its divisors is an integer number (706646556).
Almost surely, 220002311021 is an apocalyptic number.
20002311021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20002311021 is a deficient number, since it is larger than the sum of its proper divisors (13916723667).
20002311021 is a wasteful number, since it uses less digits than its factorization.
20002311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27322 (or 27315 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20002311021 its reverse (12011320002), we get a palindrome (32013631023).
The spelling of 20002311021 in words is "twenty billion, two million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •