Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …11110000001000010111011 |
3 | 20121211021200022200101010221 |
4 | 23132330331332001002323 |
5 | 23104440341341213201 |
6 | 255225533424520511 |
7 | 13431622601366566 |
oct | 1336747576010273 |
9 | 217737608611127 |
10 | 50505560101051 |
11 | 15102318aaa820 |
12 | 57b8395a80137 |
13 | 2224866768673 |
14 | c686a704b4dd |
15 | 5c8b739854a1 |
hex | 2def3df810bb |
50505560101051 has 16 divisors (see below), whose sum is σ = 57507542846208. Its totient is φ = 43906383690400.
The previous prime is 50505560101049. The next prime is 50505560101057. The reversal of 50505560101051 is 15010106550505.
It is not a de Polignac number, because 50505560101051 - 21 = 50505560101049 is a prime.
It is a super-2 number, since 2×505055601010512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50505560100998 and 50505560101016.
It is not an unprimeable number, because it can be changed into a prime (50505560101057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25155601 + ... + 27089026.
It is an arithmetic number, because the mean of its divisors is an integer number (3594221427888).
Almost surely, 250505560101051 is an apocalyptic number.
50505560101051 is a deficient number, since it is larger than the sum of its proper divisors (7001982745157).
50505560101051 is a wasteful number, since it uses less digits than its factorization.
50505560101051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52248482.
The product of its (nonzero) digits is 18750, while the sum is 34.
Adding to 50505560101051 its reverse (15010106550505), we get a palindrome (65515666651556).
The spelling of 50505560101051 in words is "fifty trillion, five hundred five billion, five hundred sixty million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •