Base | Representation |
---|---|
bin | 101110100111010001… |
… | …110010111111001100 |
3 | 11210012010222100111102 |
4 | 232213101302333030 |
5 | 1310001040204440 |
6 | 34554304442232 |
7 | 3421212223103 |
oct | 564721627714 |
9 | 153163870442 |
10 | 50051100620 |
11 | 1a2545a5774 |
12 | 984a019378 |
13 | 4948522091 |
14 | 25cb43303a |
15 | 147e0dab15 |
hex | ba7472fcc |
50051100620 has 12 divisors (see below), whose sum is σ = 105107311344. Its totient is φ = 20020440240.
The previous prime is 50051100611. The next prime is 50051100641. The reversal of 50051100620 is 2600115005.
It is a super-2 number, since 2×500511006202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 2502555031 = 50051100620 / (5 + 0 + 0 + 5 + 1 + 1 + 0 + 0 + 6 + 2 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 50051100592 and 50051100601.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1251277496 + ... + 1251277535.
It is an arithmetic number, because the mean of its divisors is an integer number (8758942612).
Almost surely, 250051100620 is an apocalyptic number.
It is an amenable number.
50051100620 is an abundant number, since it is smaller than the sum of its proper divisors (55056210724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50051100620 is a wasteful number, since it uses less digits than its factorization.
50051100620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2502555040 (or 2502555038 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 50051100620 its reverse (2600115005), we get a palindrome (52651215625).
The spelling of 50051100620 in words is "fifty billion, fifty-one million, one hundred thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •