Base | Representation |
---|---|
bin | 11101001010011001010… |
… | …000100110000010001000 |
3 | 21002120202000112001201202 |
4 | 131022121100212002020 |
5 | 230313221130232242 |
6 | 4132345320403332 |
7 | 264533430100412 |
oct | 35123120460210 |
9 | 7076660461652 |
10 | 2004026024072 |
11 | 7029a249a306 |
12 | 284488316548 |
13 | 116c95698137 |
14 | 6cdd14599b2 |
15 | 371e1693932 |
hex | 1d299426088 |
2004026024072 has 108 divisors (see below), whose sum is σ = 4022063681895. Its totient is φ = 936028698528.
The previous prime is 2004026024047. The next prime is 2004026024093. The reversal of 2004026024072 is 2704206204002.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 1002013012036 + 1002013012036 = 1001006^2 + 1001006^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=1001006.
It is a super-2 number, since 2×20040260240722 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4328349713 + ... + 4328350175.
Almost surely, 22004026024072 is an apocalyptic number.
It is an amenable number.
2004026024072 is an abundant number, since it is smaller than the sum of its proper divisors (2018037657823).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2004026024072 is an frugal number, since it uses more digits than its factorization.
2004026024072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1072 (or 535 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 29.
The spelling of 2004026024072 in words is "two trillion, four billion, twenty-six million, twenty-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •