Base | Representation |
---|---|
bin | 11110001010011… |
… | …101111100000110 |
3 | 1022021020112120100 |
4 | 132022131330012 |
5 | 2014022414200 |
6 | 122114344530 |
7 | 15353305122 |
oct | 3612357406 |
9 | 1267215510 |
10 | 506060550 |
11 | 23a726866 |
12 | 12158b146 |
13 | 80ac7818 |
14 | 4b2d2582 |
15 | 2e663d00 |
hex | 1e29df06 |
506060550 has 72 divisors (see below), whose sum is σ = 1391288184. Its totient is φ = 131806080.
The previous prime is 506060537. The next prime is 506060551. The reversal of 506060550 is 55060605.
506060550 is a `hidden beast` number, since 5 + 0 + 6 + 0 + 605 + 50 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506060551) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6274 + ... + 32426.
It is an arithmetic number, because the mean of its divisors is an integer number (19323447).
Almost surely, 2506060550 is an apocalyptic number.
506060550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 506060550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (695644092).
506060550 is an abundant number, since it is smaller than the sum of its proper divisors (885227634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506060550 is a wasteful number, since it uses less digits than its factorization.
506060550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26214 (or 26206 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 506060550 is about 22495.7896060574. The cubic root of 506060550 is about 796.8944968701.
The spelling of 506060550 in words is "five hundred six million, sixty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •