Base | Representation |
---|---|
bin | 10110110000101010100001… |
… | …00010001110110010110101 |
3 | 20120012210100201111012210021 |
4 | 23120111100202032302311 |
5 | 23030012114343113221 |
6 | 254240532555125141 |
7 | 13354015436311126 |
oct | 1330252042166265 |
9 | 216183321435707 |
10 | 50050605051061 |
11 | 14a47384809a3a |
12 | 57441864437b1 |
13 | 21c09a0939684 |
14 | c5066843804d |
15 | 5bbde76be041 |
hex | 2d855088ecb5 |
50050605051061 has 4 divisors (see below), whose sum is σ = 51214572610432. Its totient is φ = 48886637491692.
The previous prime is 50050605051043. The next prime is 50050605051077. The reversal of 50050605051061 is 16015050605005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50050605051061 - 27 = 50050605050933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50050605051011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 581983779621 + ... + 581983779706.
It is an arithmetic number, because the mean of its divisors is an integer number (12803643152608).
Almost surely, 250050605051061 is an apocalyptic number.
It is an amenable number.
50050605051061 is a deficient number, since it is larger than the sum of its proper divisors (1163967559371).
50050605051061 is a wasteful number, since it uses less digits than its factorization.
50050605051061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163967559370.
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 50050605051061 its reverse (16015050605005), we get a palindrome (66065655656066).
The spelling of 50050605051061 in words is "fifty trillion, fifty billion, six hundred five million, fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •