Base | Representation |
---|---|
bin | 111000111101101000100011… |
… | …0001111001101010010111100 |
3 | 2102201002002221202222202210211 |
4 | 1301323101012033031102330 |
5 | 1011133214111131034400 |
6 | 4533352050134042204 |
7 | 210352550134216060 |
oct | 16173210617152274 |
9 | 2381062852882724 |
10 | 501052063143100 |
11 | 135717a94275757 |
12 | 482432b61a9364 |
13 | 18677011c84081 |
14 | 8ba3099207aa0 |
15 | 3cdd7a9be0dba |
hex | 1c7b4463cd4bc |
501052063143100 has 144 divisors (see below), whose sum is σ = 1243107825507072. Its totient is φ = 171720349194240.
The previous prime is 501052063143089. The next prime is 501052063143103. The reversal of 501052063143100 is 1341360250105.
It is a super-2 number, since 2×5010520631431002 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501052063143103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21959582892 + ... + 21959605708.
It is an arithmetic number, because the mean of its divisors is an integer number (8632693232688).
Almost surely, 2501052063143100 is an apocalyptic number.
501052063143100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
501052063143100 is an abundant number, since it is smaller than the sum of its proper divisors (742055762363972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501052063143100 is a wasteful number, since it uses less digits than its factorization.
501052063143100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34052 (or 34045 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 501052063143100 in words is "five hundred one trillion, fifty-two billion, sixty-three million, one hundred forty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •