Base | Representation |
---|---|
bin | 1110101110110011100… |
… | …00100010001000000000 |
3 | 1210101111110220102002101 |
4 | 13113121300202020000 |
5 | 31243111111132232 |
6 | 1024310115000144 |
7 | 51366141463615 |
oct | 7273160421000 |
9 | 1711443812071 |
10 | 506164552192 |
11 | 18573276a832 |
12 | 82121599054 |
13 | 3896733c2b0 |
14 | 1a6d9c2850c |
15 | d276e221e7 |
hex | 75d9c22200 |
506164552192 has 80 divisors (see below), whose sum is σ = 1099129573080. Its totient is φ = 231470825472.
The previous prime is 506164552067. The next prime is 506164552193. The reversal of 506164552192 is 291255461605.
It can be written as a sum of positive squares in 4 ways, for example, as 417398692096 + 88765860096 = 646064^2 + 297936^2 .
It is not an unprimeable number, because it can be changed into a prime (506164552193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 376668 + ... + 1074340.
Almost surely, 2506164552192 is an apocalyptic number.
506164552192 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506164552192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (549564786540).
506164552192 is an abundant number, since it is smaller than the sum of its proper divisors (592965020888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506164552192 is a wasteful number, since it uses less digits than its factorization.
506164552192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697813 (or 697797 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 46.
The spelling of 506164552192 in words is "five hundred six billion, one hundred sixty-four million, five hundred fifty-two thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •