Base | Representation |
---|---|
bin | 11101001111101000110… |
… | …011100010101110111000 |
3 | 21010010021100110202120101 |
4 | 131033220303202232320 |
5 | 230411233310143302 |
6 | 4135120101005144 |
7 | 265123065231145 |
oct | 35175063425670 |
9 | 7103240422511 |
10 | 2009655552952 |
11 | 705321193713 |
12 | 2855996b37b4 |
13 | 117681a91008 |
14 | 6d3a6d8d3cc |
15 | 374209ec287 |
hex | 1d3e8ce2bb8 |
2009655552952 has 16 divisors (see below), whose sum is σ = 3771823924440. Its totient is φ = 1003835839776.
The previous prime is 2009655552941. The next prime is 2009655552991. The reversal of 2009655552952 is 2592555569002.
It is a junction number, because it is equal to n+sod(n) for n = 2009655552893 and 2009655552902.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 123983478 + ... + 123999685.
Almost surely, 22009655552952 is an apocalyptic number.
It is an amenable number.
2009655552952 is a deficient number, since it is larger than the sum of its proper divisors (1762168371488).
2009655552952 is a wasteful number, since it uses less digits than its factorization.
2009655552952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247984182 (or 247984178 counting only the distinct ones).
The product of its (nonzero) digits is 12150000, while the sum is 55.
The spelling of 2009655552952 in words is "two trillion, nine billion, six hundred fifty-five million, five hundred fifty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •