Base | Representation |
---|---|
bin | 1110100011011100010… |
… | …00100101100100000000 |
3 | 1202210202022112202122221 |
4 | 13101232020211210000 |
5 | 31143112332413404 |
6 | 1021420505540424 |
7 | 51062023310614 |
oct | 7215610454400 |
9 | 1683668482587 |
10 | 500063951104 |
11 | 183092077953 |
12 | 80aba4a4714 |
13 | 3820447c273 |
14 | 1a2bb90d344 |
15 | d01b566954 |
hex | 746e225900 |
500063951104 has 81 divisors (see below), whose sum is σ = 1007773889283. Its totient is φ = 247650287616.
The previous prime is 500063951089. The next prime is 500063951113. The reversal of 500063951104 is 401159360005.
The square root of 500063951104 is 707152.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 30499129600 + 469564821504 = 174640^2 + 685248^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 500063951104.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2183685262 + ... + 2183685490.
Almost surely, 2500063951104 is an apocalyptic number.
500063951104 is the 707152-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 500063951104
500063951104 is an abundant number, since it is smaller than the sum of its proper divisors (507709938179).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500063951104 is an frugal number, since it uses more digits than its factorization.
500063951104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860 (or 424 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 34.
The spelling of 500063951104 in words is "five hundred billion, sixty-three million, nine hundred fifty-one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •