Base | Representation |
---|---|
bin | 100101100011000100110… |
… | …1011000110110001111010 |
3 | 200021100022200102201000110 |
4 | 1023012021223012301322 |
5 | 1134022314232013200 |
6 | 14550421524245150 |
7 | 1041560424000351 |
oct | 113061153066172 |
9 | 20240280381013 |
10 | 5160565501050 |
11 | 170a646764a63 |
12 | 6b419ab407b6 |
13 | 2b584053aa9b |
14 | 13bab6422998 |
15 | 8e388b64b50 |
hex | 4b189ac6c7a |
5160565501050 has 24 divisors (see below), whose sum is σ = 12798202442976. Its totient is φ = 1376150800240.
The previous prime is 5160565501037. The next prime is 5160565501057. The reversal of 5160565501050 is 501055650615.
It is a super-2 number, since 2×51605655010502 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5160565501057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17201884854 + ... + 17201885153.
It is an arithmetic number, because the mean of its divisors is an integer number (533258435124).
Almost surely, 25160565501050 is an apocalyptic number.
5160565501050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5160565501050 is an abundant number, since it is smaller than the sum of its proper divisors (7637636941926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160565501050 is a wasteful number, since it uses less digits than its factorization.
5160565501050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34403770022 (or 34403770017 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 39.
It can be divided in two parts, 516056 and 5501050, that added together give a palindrome (6017106).
The spelling of 5160565501050 in words is "five trillion, one hundred sixty billion, five hundred sixty-five million, five hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •