Base | Representation |
---|---|
bin | 11110001010010… |
… | …000100000110100 |
3 | 1022021010202010112 |
4 | 132022100200310 |
5 | 2014014134211 |
6 | 122113242152 |
7 | 15352655600 |
oct | 3612204064 |
9 | 1267122115 |
10 | 506005556 |
11 | 23a699511 |
12 | 121563358 |
13 | 80aa8794 |
14 | 4b2ba500 |
15 | 2e65288b |
hex | 1e290834 |
506005556 has 36 divisors (see below), whose sum is σ = 1040322276. Its totient is φ = 214704000.
The previous prime is 506005537. The next prime is 506005567. The reversal of 506005556 is 655500605.
It can be written as a sum of positive squares in 2 ways, for example, as 455822500 + 50183056 = 21350^2 + 7084^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7016 + ... + 32576.
It is an arithmetic number, because the mean of its divisors is an integer number (28897841).
Almost surely, 2506005556 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506005556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (520161138).
506005556 is an abundant number, since it is smaller than the sum of its proper divisors (534316720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506005556 is a wasteful number, since it uses less digits than its factorization.
506005556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25680 (or 25671 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 32.
The square root of 506005556 is about 22494.5672552285. The cubic root of 506005556 is about 796.8656294395.
The spelling of 506005556 in words is "five hundred six million, five thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •