Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …00101101001000001000101 |
3 | 20121211201021020020010120001 |
4 | 23133001021211221001011 |
5 | 23110024040300130221 |
6 | 255231555135041301 |
7 | 13432142061061003 |
oct | 1337011145510105 |
9 | 217751236203501 |
10 | 50510050005061 |
11 | 15104212485099 |
12 | 57b9229670231 |
13 | 2225100a189ba |
14 | c689b1489a73 |
15 | 5c8d37c2c391 |
hex | 2df049969045 |
50510050005061 has 16 divisors (see below), whose sum is σ = 50676207624000. Its totient is φ = 50344190265600.
The previous prime is 50510050005013. The next prime is 50510050005083. The reversal of 50510050005061 is 16050005001505.
It is a cyclic number.
It is not a de Polignac number, because 50510050005061 - 223 = 50510041616453 is a prime.
It is a super-2 number, since 2×505100500050612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50510050005011) 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, 1324001215 + ... + 1324039363.
It is an arithmetic number, because the mean of its divisors is an integer number (3167262976500).
Almost surely, 250510050005061 is an apocalyptic number.
It is an amenable number.
50510050005061 is a deficient number, since it is larger than the sum of its proper divisors (166157618939).
50510050005061 is a wasteful number, since it uses less digits than its factorization.
50510050005061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41940.
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 50510050005061 its reverse (16050005001505), we get a palindrome (66560055006566).
The spelling of 50510050005061 in words is "fifty trillion, five hundred ten billion, fifty million, five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •