Base | Representation |
---|---|
bin | 1110100101010001110… |
… | …10000110101000000000 |
3 | 1202220022000222202022221 |
4 | 13102220322012220000 |
5 | 31202122300310422 |
6 | 1022102412340424 |
7 | 51125325546331 |
oct | 7225072065000 |
9 | 1686260882287 |
10 | 501050010112 |
11 | 183548739653 |
12 | 81134774714 |
13 | 38330847b32 |
14 | 1a37286c288 |
15 | d077de23c7 |
hex | 74a8e86a00 |
501050010112 has 80 divisors (see below), whose sum is σ = 1050358915584. Its totient is φ = 238468608000.
The previous prime is 501050010101. The next prime is 501050010121. The reversal of 501050010112 is 211010050105.
It is a super-2 number, since 2×5010500101122 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 709437 + ... + 1226947.
Almost surely, 2501050010112 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 501050010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (525179457792).
501050010112 is an abundant number, since it is smaller than the sum of its proper divisors (549308905472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501050010112 is an equidigital number, since it uses as much as digits as its factorization.
501050010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517621 (or 517605 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 16.
Adding to 501050010112 its reverse (211010050105), we get a palindrome (712060060217).
The spelling of 501050010112 in words is "five hundred one billion, fifty million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •