Base | Representation |
---|---|
bin | 10111000001110100110010… |
… | …10011110000111011101010 |
3 | 20122022011022011010001210020 |
4 | 23200322121103300323222 |
5 | 23114142201021440200 |
6 | 255411445315501310 |
7 | 13444431161126160 |
oct | 1340723123607352 |
9 | 218264264101706 |
10 | 50640236515050 |
11 | 15154449362a06 |
12 | 581a5008b7836 |
13 | 223447a433570 |
14 | c71001625230 |
15 | 5cc407132ea0 |
hex | 2e0e994f0eea |
50640236515050 has 96 divisors (see below), whose sum is σ = 154569583496832. Its totient is φ = 10684533415680.
The previous prime is 50640236515019. The next prime is 50640236515067. The reversal of 50640236515050 is 5051563204605.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 50640236514993 and 50640236515011.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1854940069 + ... + 1854967368.
It is an arithmetic number, because the mean of its divisors is an integer number (1610099828092).
Almost surely, 250640236515050 is an apocalyptic number.
50640236515050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50640236515050 is an abundant number, since it is smaller than the sum of its proper divisors (103929346981782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50640236515050 is a wasteful number, since it uses less digits than its factorization.
50640236515050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3709907472 (or 3709907467 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 42.
Adding to 50640236515050 its reverse (5051563204605), we get a palindrome (55691799719655).
The spelling of 50640236515050 in words is "fifty trillion, six hundred forty billion, two hundred thirty-six million, five hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •