Base | Representation |
---|---|
bin | 101110111000101000… |
… | …100000011010010000 |
3 | 11210221102212010000100 |
4 | 232320220200122100 |
5 | 1311100110012022 |
6 | 35043225252400 |
7 | 3431346130206 |
oct | 567050403220 |
9 | 153842763010 |
10 | 50342266512 |
11 | 1a393995a3a |
12 | 990b634100 |
13 | 4993948ba5 |
14 | 2617d87076 |
15 | 14999521ac |
hex | bb8a20690 |
50342266512 has 120 divisors (see below), whose sum is σ = 144267552000. Its totient is φ = 16378838784.
The previous prime is 50342266493. The next prime is 50342266529. The reversal of 50342266512 is 21566224305.
50342266512 is a `hidden beast` number, since 5 + 0 + 342 + 266 + 51 + 2 = 666.
It is a super-2 number, since 2×503422665122 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 14852914 + ... + 14856302.
It is an arithmetic number, because the mean of its divisors is an integer number (1202229600).
Almost surely, 250342266512 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 50342266512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72133776000).
50342266512 is an abundant number, since it is smaller than the sum of its proper divisors (93925285488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50342266512 is a wasteful number, since it uses less digits than its factorization.
50342266512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5845 (or 5836 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 50342266512 in words is "fifty billion, three hundred forty-two million, two hundred sixty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •