Base | Representation |
---|---|
bin | 1110101111101000100… |
… | …11111000010001011001 |
3 | 1210102122112010210200001 |
4 | 13113310103320101121 |
5 | 31300014131304221 |
6 | 1024422231013001 |
7 | 51413161111033 |
oct | 7276423702131 |
9 | 1712575123601 |
10 | 506610025561 |
11 | 185941174542 |
12 | 8222680a161 |
13 | 38a087127c3 |
14 | 1a73d068c53 |
15 | d2a10b9391 |
hex | 75f44f8459 |
506610025561 has 16 divisors (see below), whose sum is σ = 522157293504. Its totient is φ = 491161402944.
The previous prime is 506610025553. The next prime is 506610025609. The reversal of 506610025561 is 165520016605.
It is not a de Polignac number, because 506610025561 - 23 = 506610025553 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 506610025561.
It is not an unprimeable number, because it can be changed into a prime (506610025861) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60573366 + ... + 60581728.
It is an arithmetic number, because the mean of its divisors is an integer number (32634830844).
Almost surely, 2506610025561 is an apocalyptic number.
It is an amenable number.
506610025561 is a deficient number, since it is larger than the sum of its proper divisors (15547267943).
506610025561 is a wasteful number, since it uses less digits than its factorization.
506610025561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14040.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 506610025561 in words is "five hundred six billion, six hundred ten million, twenty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •