Base | Representation |
---|---|
bin | 100101111101110111011… |
… | …011011100101110110111 |
3 | 100020102102002200020200110 |
4 | 211331313123130232313 |
5 | 320221313000123301 |
6 | 5314325215114103 |
7 | 356332443111201 |
oct | 45756733345667 |
9 | 10212362606613 |
10 | 2609048832951 |
11 | 916545059520 |
12 | 361799212933 |
13 | 15c055b0bcb2 |
14 | 903c881b771 |
15 | 47d024710d6 |
hex | 25f776dcbb7 |
2609048832951 has 64 divisors (see below), whose sum is σ = 4107391326720. Its totient is φ = 1455858178560.
The previous prime is 2609048832947. The next prime is 2609048832977. The reversal of 2609048832951 is 1592388409062.
It is not a de Polignac number, because 2609048832951 - 22 = 2609048832947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 2609048832891 and 2609048832900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2609048832911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 20281405 + ... + 20409641.
It is an arithmetic number, because the mean of its divisors is an integer number (64177989480).
Almost surely, 22609048832951 is an apocalyptic number.
2609048832951 is a deficient number, since it is larger than the sum of its proper divisors (1498342493769).
2609048832951 is a wasteful number, since it uses less digits than its factorization.
2609048832951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129184.
The product of its (nonzero) digits is 7464960, while the sum is 57.
The spelling of 2609048832951 in words is "two trillion, six hundred nine billion, forty-eight million, eight hundred thirty-two thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •