Base | Representation |
---|---|
bin | 101011101110000000000… |
… | …101010001000001110101 |
3 | 101122012200222211002001110 |
4 | 223232000011101001311 |
5 | 343210332214112041 |
6 | 10220100503545233 |
7 | 430025060120004 |
oct | 53560005210165 |
9 | 11565628732043 |
10 | 3004331004021 |
11 | a59147590146 |
12 | 40631445b219 |
13 | 18a3cbbb6389 |
14 | a55a61b0c3b |
15 | 53239a9e516 |
hex | 2bb80151075 |
3004331004021 has 16 divisors (see below), whose sum is σ = 4042817136000. Its totient is φ = 1984433825088.
The previous prime is 3004331004007. The next prime is 3004331004049. The reversal of 3004331004021 is 1204001334003.
3004331004021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-3004331004021 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3004331004071) 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 15 ways as a sum of consecutive naturals, for example, 8287401 + ... + 8642318.
It is an arithmetic number, because the mean of its divisors is an integer number (252676071000).
Almost surely, 23004331004021 is an apocalyptic number.
It is an amenable number.
3004331004021 is a deficient number, since it is larger than the sum of its proper divisors (1038486131979).
3004331004021 is a wasteful number, since it uses less digits than its factorization.
3004331004021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16930268.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3004331004021 its reverse (1204001334003), we get a palindrome (4208332338024).
The spelling of 3004331004021 in words is "three trillion, four billion, three hundred thirty-one million, four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •