Base | Representation |
---|---|
bin | 1110101110100001110… |
… | …10110110010000011110 |
3 | 1210101010010212110000120 |
4 | 13113100322312100132 |
5 | 31242310130324100 |
6 | 1024243300335410 |
7 | 51362361152331 |
oct | 7272072662036 |
9 | 1711103773016 |
10 | 506016261150 |
11 | 185666a95554 |
12 | 8209b9a4566 |
13 | 389426bb20a |
14 | 1a6c4266618 |
15 | d268dce0a0 |
hex | 75d0eb641e |
506016261150 has 96 divisors (see below), whose sum is σ = 1263133440000. Its totient is φ = 134057212800.
The previous prime is 506016261077. The next prime is 506016261187. The reversal of 506016261150 is 51162610605.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15434976 + ... + 15467724.
It is an arithmetic number, because the mean of its divisors is an integer number (13157640000).
Almost surely, 2506016261150 is an apocalyptic number.
506016261150 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 506016261150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (631566720000).
506016261150 is an abundant number, since it is smaller than the sum of its proper divisors (757117178850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506016261150 is a wasteful number, since it uses less digits than its factorization.
506016261150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33434 (or 33429 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 33.
Adding to 506016261150 its reverse (51162610605), we get a palindrome (557178871755).
The spelling of 506016261150 in words is "five hundred six billion, sixteen million, two hundred sixty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •