Base | Representation |
---|---|
bin | 11101110011100… |
… | …101001110101000 |
3 | 1021211221201212100 |
4 | 131303211032220 |
5 | 2011003423341 |
6 | 121342013400 |
7 | 15251310033 |
oct | 3563451650 |
9 | 1254851770 |
10 | 500061096 |
11 | 2372a9337 |
12 | 11b577260 |
13 | 7c7a6b52 |
14 | 4a5b001a |
15 | 2dd7b3b6 |
hex | 1dce53a8 |
500061096 has 96 divisors (see below), whose sum is σ = 1389609000. Its totient is φ = 162404352.
The previous prime is 500061083. The next prime is 500061109. The reversal of 500061096 is 690160005.
It is an interprime number because it is at equal distance from previous prime (500061083) and next prime (500061109).
It can be written as a sum of positive squares in 4 ways, for example, as 367488900 + 132572196 = 19170^2 + 11514^2 .
It is a super-2 number, since 2×5000610962 = 500122199465442432, which contains 22 as substring.
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, 467250 + ... + 468318.
Almost surely, 2500061096 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 500061096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (694804500).
500061096 is an abundant number, since it is smaller than the sum of its proper divisors (889547904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500061096 is a wasteful number, since it uses less digits than its factorization.
500061096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1243 (or 1236 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 500061096 is about 22362.0458813589. The cubic root of 500061096 is about 793.7328526190.
The spelling of 500061096 in words is "five hundred million, sixty-one thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •