Base | Representation |
---|---|
bin | 1110101110100111100… |
… | …11011100000110010000 |
3 | 1210101020111220212220220 |
4 | 13113103303130012100 |
5 | 31242410022310030 |
6 | 1024252145433040 |
7 | 51363516361503 |
oct | 7272363340620 |
9 | 1711214825826 |
10 | 506064650640 |
11 | 18569133626a |
12 | 820b403b780 |
13 | 3894c731553 |
14 | 1a6ca86113a |
15 | d26d28ba10 |
hex | 75d3cdc190 |
506064650640 has 160 divisors (see below), whose sum is σ = 1610031772800. Its totient is φ = 131445780480.
The previous prime is 506064650629. The next prime is 506064650653. The reversal of 506064650640 is 46056460605.
It is a happy number.
It is a super-2 number, since 2×5060646506402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 506064650592 and 506064650601.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1379500 + ... + 1707380.
It is an arithmetic number, because the mean of its divisors is an integer number (10062698580).
Almost surely, 2506064650640 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 506064650640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (805015886400).
506064650640 is an abundant number, since it is smaller than the sum of its proper divisors (1103967122160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506064650640 is a wasteful number, since it uses less digits than its factorization.
506064650640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328065 (or 328059 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 506064650640 in words is "five hundred six billion, sixty-four million, six hundred fifty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •