Base | Representation |
---|---|
bin | 101110100111010001… |
… | …011010011100100100 |
3 | 11210012010210020121110 |
4 | 232213101122130210 |
5 | 1310001024000400 |
6 | 34554302345020 |
7 | 3421211324043 |
oct | 564721323444 |
9 | 153163706543 |
10 | 50051000100 |
11 | 1a2545371a2 |
12 | 9849b8b170 |
13 | 49484b83ba |
14 | 25cb40855a |
15 | 147e0bae50 |
hex | ba745a724 |
50051000100 has 72 divisors (see below), whose sum is σ = 148346317728. Its totient is φ = 13021395200.
The previous prime is 50051000081. The next prime is 50051000113. The reversal of 50051000100 is 100015005.
50051000100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×500510001002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 2022294 + ... + 2046893.
It is an arithmetic number, because the mean of its divisors is an integer number (2060365524).
Almost surely, 250051000100 is an apocalyptic number.
50051000100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50051000100 is an abundant number, since it is smaller than the sum of its proper divisors (98295317628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50051000100 is a wasteful number, since it uses less digits than its factorization.
50051000100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4069245 (or 4069238 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 12.
Adding to 50051000100 its reverse (100015005), we get a palindrome (50151015105).
The spelling of 50051000100 in words is "fifty billion, fifty-one million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •