Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …10011001000000010010010 |
3 | 20120012201210221022212102021 |
4 | 23120110230303020002102 |
5 | 23030004402402000200 |
6 | 254240353300442054 |
7 | 13353664536232033 |
oct | 1330245463100222 |
9 | 216181727285367 |
10 | 50050005500050 |
11 | 14a470a7338436 |
12 | 57440396a932a |
13 | 21c090666a26a |
14 | c5060c96aa8a |
15 | 5bbdaec3e41a |
hex | 2d852ccc8092 |
50050005500050 has 12 divisors (see below), whose sum is σ = 93093010230186. Its totient is φ = 20020002200000.
The previous prime is 50050005500039. The next prime is 50050005500051. The reversal of 50050005500050 is 5000550005005.
It can be written as a sum of positive squares in 3 ways, for example, as 24808856760801 + 25241148739249 = 4980849^2 + 5024057^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 50050005499988 and 50050005500024.
It is not an unprimeable number, because it can be changed into a prime (50050005500051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 500500054951 + ... + 500500055050.
Almost surely, 250050005500050 is an apocalyptic number.
50050005500050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50050005500050 is a deficient number, since it is larger than the sum of its proper divisors (43043004730136).
50050005500050 is a wasteful number, since it uses less digits than its factorization.
50050005500050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001000110013 (or 1001000110008 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
Adding to 50050005500050 its reverse (5000550005005), we get a palindrome (55050555505055).
The spelling of 50050005500050 in words is "fifty trillion, fifty billion, five million, five hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •