Base | Representation |
---|---|
bin | 11101001101010100000… |
… | …000010000111010011100 |
3 | 21002212211100220221010102 |
4 | 131031110000100322130 |
5 | 230341130211121102 |
6 | 4134024241000232 |
7 | 265004162463113 |
oct | 35152400207234 |
9 | 7085740827112 |
10 | 2007159082652 |
11 | 70425aa80619 |
12 | 285001623078 |
13 | 1173747c9359 |
14 | 6d20b5bac7a |
15 | 3732676c402 |
hex | 1d354010e9c |
2007159082652 has 24 divisors (see below), whose sum is σ = 3519974460912. Its totient is φ = 1001452435200.
The previous prime is 2007159082637. The next prime is 2007159082667. The reversal of 2007159082652 is 2562809517002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2007159082637) and next prime (2007159082667).
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2007159082597 and 2007159082606.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 28507652 + ... + 28577972.
It is an arithmetic number, because the mean of its divisors is an integer number (146665602538).
Almost surely, 22007159082652 is an apocalyptic number.
It is an amenable number.
2007159082652 is a deficient number, since it is larger than the sum of its proper divisors (1512815378260).
2007159082652 is a wasteful number, since it uses less digits than its factorization.
2007159082652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85349 (or 85347 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 47.
The spelling of 2007159082652 in words is "two trillion, seven billion, one hundred fifty-nine million, eighty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •