Base | Representation |
---|---|
bin | 101000000101110100010… |
… | …0110100110010101000010 |
3 | 201111202101220010110001112 |
4 | 1100023220212212111002 |
5 | 1210234040412143200 |
6 | 15415140545003322 |
7 | 1106042121346436 |
oct | 120135046462502 |
9 | 21452356113045 |
10 | 5510050506050 |
11 | 1834887955a02 |
12 | 74ba74923542 |
13 | 30c79850402c |
14 | 15098b7189c6 |
15 | 984e088c535 |
hex | 502e89a6542 |
5510050506050 has 48 divisors (see below), whose sum is σ = 10470197721600. Its totient is φ = 2156415864960.
The previous prime is 5510050506013. The next prime is 5510050506053. The reversal of 5510050506050 is 506050500155.
It is a super-2 number, since 2×55100505060502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5510050505998 and 5510050506016.
It is not an unprimeable number, because it can be changed into a prime (5510050506053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6780647 + ... + 7549653.
It is an arithmetic number, because the mean of its divisors is an integer number (218129119200).
Almost surely, 25510050506050 is an apocalyptic number.
5510050506050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5510050506050 is a deficient number, since it is larger than the sum of its proper divisors (4960147215550).
5510050506050 is a wasteful number, since it uses less digits than its factorization.
5510050506050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772115 (or 772110 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 32.
The spelling of 5510050506050 in words is "five trillion, five hundred ten billion, fifty million, five hundred six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •