Base | Representation |
---|---|
bin | 101110100100100110… |
… | …001000110001111000 |
3 | 11210002000022010202222 |
4 | 232210212020301320 |
5 | 1304403030213422 |
6 | 34550020143212 |
7 | 3420124563152 |
oct | 564446106170 |
9 | 153060263688 |
10 | 50006101112 |
11 | 1a23115a9a0 |
12 | 9836b37b08 |
13 | 493c0c7a56 |
14 | 25c547bad2 |
15 | 147a19c842 |
hex | ba4988c78 |
50006101112 has 64 divisors (see below), whose sum is σ = 105701016960. Its totient is φ = 21981456000.
The previous prime is 50006101111. The next prime is 50006101129. The reversal of 50006101112 is 21110160005.
It is a super-2 number, since 2×500061011122 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50006101111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 316763 + ... + 447605.
It is an arithmetic number, because the mean of its divisors is an integer number (1651578390).
Almost surely, 250006101112 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 50006101112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52850508480).
50006101112 is an abundant number, since it is smaller than the sum of its proper divisors (55694915848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50006101112 is a wasteful number, since it uses less digits than its factorization.
50006101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131004 (or 131000 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 50006101112 its reverse (21110160005), we get a palindrome (71116261117).
The spelling of 50006101112 in words is "fifty billion, six million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •