Base | Representation |
---|---|
bin | 10110101111100000110110… |
… | …00010111101000100110100 |
3 | 20120002000021021020111111010 |
4 | 23113300123002331010310 |
5 | 23023340114024011113 |
6 | 254210432140312220 |
7 | 13351115341113414 |
oct | 1327603302750464 |
9 | 216060237214433 |
10 | 50011052953908 |
11 | 14a31628674a42 |
12 | 5738588542670 |
13 | 21ba0395cb3a7 |
14 | c4c795540644 |
15 | 5bad801ae1c3 |
hex | 2d7c1b0bd134 |
50011052953908 has 96 divisors (see below), whose sum is σ = 118827837063936. Its totient is φ = 16368623050752.
The previous prime is 50011052953891. The next prime is 50011052953931. The reversal of 50011052953908 is 80935925011005.
50011052953908 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×500110529539082 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 70992660 + ... + 71693652.
It is an arithmetic number, because the mean of its divisors is an integer number (1237789969416).
Almost surely, 250011052953908 is an apocalyptic number.
It is an amenable number.
50011052953908 is an abundant number, since it is smaller than the sum of its proper divisors (68816784110028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50011052953908 is a wasteful number, since it uses less digits than its factorization.
50011052953908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701593 (or 701591 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 48.
The spelling of 50011052953908 in words is "fifty trillion, eleven billion, fifty-two million, nine hundred fifty-three thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •