Base | Representation |
---|---|
bin | 10110101111100100101011… |
… | …01100111100000001000000 |
3 | 20120002012120200101220011010 |
4 | 23113302111230330001000 |
5 | 23023403322324424333 |
6 | 254211412250520520 |
7 | 13351220336256330 |
oct | 1327622554740100 |
9 | 216065520356133 |
10 | 50013110779968 |
11 | 14a32494218136 |
12 | 5738a61736140 |
13 | 21ba2a6a4104b |
14 | c4c90c96d0c0 |
15 | 5bae50b95563 |
hex | 2d7c95b3c040 |
50013110779968 has 112 divisors (see below), whose sum is σ = 151277143443584. Its totient is φ = 14285017128960.
The previous prime is 50013110779939. The next prime is 50013110779979. The reversal of 50013110779968 is 86997701131005.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×500131107799682 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1460023 + ... + 10107318.
Almost surely, 250013110779968 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 50013110779968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75638571721792).
50013110779968 is an abundant number, since it is smaller than the sum of its proper divisors (101264032663616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50013110779968 is a wasteful number, since it uses less digits than its factorization.
50013110779968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11570580 (or 11570570 counting only the distinct ones).
The product of its (nonzero) digits is 2857680, while the sum is 57.
The spelling of 50013110779968 in words is "fifty trillion, thirteen billion, one hundred ten million, seven hundred seventy-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •