Base | Representation |
---|---|
bin | 10110110010011110001010… |
… | …11000111111101000100100 |
3 | 20120102201121212212211000210 |
4 | 23121033011120333220210 |
5 | 23032021244421343314 |
6 | 254325242044335420 |
7 | 13361344205132532 |
oct | 1331170530775044 |
9 | 216381555784023 |
10 | 50112695106084 |
11 | 14a70746a522a6 |
12 | 5754214244570 |
13 | 21c67b73b1bc0 |
14 | c53678709152 |
15 | 5bd82d672559 |
hex | 2d93c563fa24 |
50112695106084 has 96 divisors (see below), whose sum is σ = 127531756437120. Its totient is φ = 15222972441600.
The previous prime is 50112695106053. The next prime is 50112695106113. The reversal of 50112695106084 is 48060159621105.
It is a super-2 number, since 2×501126951060842 (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 31 ways as a sum of consecutive naturals, for example, 6447079 + ... + 11907569.
It is an arithmetic number, because the mean of its divisors is an integer number (1328455796220).
Almost surely, 250112695106084 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 50112695106084, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63765878218560).
50112695106084 is an abundant number, since it is smaller than the sum of its proper divisors (77419061331036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50112695106084 is a wasteful number, since it uses less digits than its factorization.
50112695106084 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5461261 (or 5461259 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 48.
The spelling of 50112695106084 in words is "fifty trillion, one hundred twelve billion, six hundred ninety-five million, one hundred six thousand, eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •