Base | Representation |
---|---|
bin | 11101001010110111101… |
… | …011101110100000001101 |
3 | 21002122001120222112202210 |
4 | 131022313223232200031 |
5 | 230320242313000013 |
6 | 4132512112541033 |
7 | 264552165501654 |
oct | 35126753564015 |
9 | 7078046875683 |
10 | 2004536453133 |
11 | 70313462a205 |
12 | 2845ab251779 |
13 | 117047362176 |
14 | 6d03d16819b |
15 | 372213bbcc3 |
hex | 1d2b7aee80d |
2004536453133 has 8 divisors (see below), whose sum is σ = 2678916468096. Its totient is φ = 1333257036800.
The previous prime is 2004536453033. The next prime is 2004536453137. The reversal of 2004536453133 is 3313546354002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2004536453133 - 212 = 2004536449037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2004536453091 and 2004536453100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2004536453137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 775148148 + ... + 775150733.
It is an arithmetic number, because the mean of its divisors is an integer number (334864558512).
Almost surely, 22004536453133 is an apocalyptic number.
It is an amenable number.
2004536453133 is a deficient number, since it is larger than the sum of its proper divisors (674380014963).
2004536453133 is a wasteful number, since it uses less digits than its factorization.
2004536453133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550299315.
The product of its (nonzero) digits is 388800, while the sum is 39.
The spelling of 2004536453133 in words is "two trillion, four billion, five hundred thirty-six million, four hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •