Base | Representation |
---|---|
bin | 101110100111010001… |
… | …110101101011000100 |
3 | 11210012010222220120211 |
4 | 232213101311223010 |
5 | 1310001041032440 |
6 | 34554305005204 |
7 | 3421212300136 |
oct | 564721655304 |
9 | 153163886524 |
10 | 50051111620 |
11 | 1a254602a64 |
12 | 984a023804 |
13 | 49485270a3 |
14 | 25cb437056 |
15 | 147e0ddeea |
hex | ba7475ac4 |
50051111620 has 48 divisors (see below), whose sum is σ = 110174980608. Its totient is φ = 19077891840.
The previous prime is 50051111563. The next prime is 50051111683. The reversal of 50051111620 is 2611115005.
It is a happy number.
It is a super-2 number, since 2×500511116202 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50051111591 and 50051111600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 674484 + ... + 745003.
It is an arithmetic number, because the mean of its divisors is an integer number (2295312096).
Almost surely, 250051111620 is an apocalyptic number.
It is an amenable number.
50051111620 is an abundant number, since it is smaller than the sum of its proper divisors (60123868988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50051111620 is a wasteful number, since it uses less digits than its factorization.
50051111620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1419580 (or 1419578 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 50051111620 its reverse (2611115005), we get a palindrome (52662226625).
The spelling of 50051111620 in words is "fifty billion, fifty-one million, one hundred eleven thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •