Base | Representation |
---|---|
bin | 11110001101111… |
… | …001111100001011 |
3 | 1022022221022200100 |
4 | 132031321330023 |
5 | 2014240233200 |
6 | 122145540443 |
7 | 15364050243 |
oct | 3615717413 |
9 | 1268838610 |
10 | 506961675 |
11 | 2401918a0 |
12 | 121944723 |
13 | 81051a2c |
14 | 4b488b23 |
15 | 2e790d00 |
hex | 1e379f0b |
506961675 has 72 divisors (see below), whose sum is σ = 1048928400. Its totient is φ = 231321600.
The previous prime is 506961659. The next prime is 506961677. The reversal of 506961675 is 576169605.
It is not a de Polignac number, because 506961675 - 24 = 506961659 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 506961675.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506961677) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 36051 + ... + 48099.
It is an arithmetic number, because the mean of its divisors is an integer number (14568450).
Almost surely, 2506961675 is an apocalyptic number.
506961675 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
506961675 is an abundant number, since it is smaller than the sum of its proper divisors (541966725).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506961675 is a wasteful number, since it uses less digits than its factorization.
506961675 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12093 (or 12085 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 45.
The square root of 506961675 is about 22515.8094458094. The cubic root of 506961675 is about 797.3672174708.
The spelling of 506961675 in words is "five hundred six million, nine hundred sixty-one thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •