Base | Representation |
---|---|
bin | 1000101001001000… |
… | …1011001000110101 |
3 | 12222200112020011110 |
4 | 2022102023020311 |
5 | 14222411120041 |
6 | 1022114025233 |
7 | 111330562524 |
oct | 21222131065 |
9 | 5880466143 |
10 | 2320020021 |
11 | a90655420 |
12 | 548b78219 |
13 | 2ac864717 |
14 | 1801a04bb |
15 | d8a28516 |
hex | 8a48b235 |
2320020021 has 16 divisors (see below), whose sum is σ = 3396930048. Its totient is φ = 1396758000.
The previous prime is 2320019953. The next prime is 2320020029. The reversal of 2320020021 is 1200200232.
It is not a de Polignac number, because 2320020021 - 218 = 2319757877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2320019979 and 2320020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320020029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227811 + ... + 237776.
It is an arithmetic number, because the mean of its divisors is an integer number (212308128).
Almost surely, 22320020021 is an apocalyptic number.
It is an amenable number.
2320020021 is a deficient number, since it is larger than the sum of its proper divisors (1076910027).
2320020021 is a wasteful number, since it uses less digits than its factorization.
2320020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465752.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2320020021 is about 48166.5861464148. The cubic root of 2320020021 is about 1323.8249976725.
Adding to 2320020021 its reverse (1200200232), we get a palindrome (3520220253).
It can be divided in two parts, 2 and 320020021, that added together give a palindrome (320020023).
The spelling of 2320020021 in words is "two billion, three hundred twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •