Base | Representation |
---|---|
bin | 111001100111111111100000… |
… | …1001010001011001101010000 |
3 | 2110110200122220001110200002101 |
4 | 1303033333001022023031100 |
5 | 1012414110023330414342 |
6 | 4554010340102130144 |
7 | 211523265302015026 |
oct | 16317770112131520 |
9 | 2413618801420071 |
10 | 506873806107472 |
11 | 137561a79413951 |
12 | 48a23658120954 |
13 | 189a9cc180ca9b |
14 | 8d24b748a8716 |
15 | 3d8ee3e4ae3b7 |
hex | 1ccffc128b350 |
506873806107472 has 120 divisors (see below), whose sum is σ = 1044896493362112. Its totient is φ = 238149090816000.
The previous prime is 506873806107467. The next prime is 506873806107517. The reversal of 506873806107472 is 274701608378605.
It is a super-4 number, since 4×5068738061074724 (a number of 60 digits) contains 4444 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15979108572 + ... + 15979140292.
Almost surely, 2506873806107472 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 506873806107472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (522448246681056).
506873806107472 is an abundant number, since it is smaller than the sum of its proper divisors (538022687254640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506873806107472 is a wasteful number, since it uses less digits than its factorization.
506873806107472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37157 (or 37134 counting only the distinct ones).
The product of its (nonzero) digits is 94832640, while the sum is 64.
The spelling of 506873806107472 in words is "five hundred six trillion, eight hundred seventy-three billion, eight hundred six million, one hundred seven thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •