Base | Representation |
---|---|
bin | 10110101111010000111010… |
… | …11011100100110001000100 |
3 | 20120001012012102001020202110 |
4 | 23113220131123210301010 |
5 | 23023220111233342110 |
6 | 254202455513541020 |
7 | 13350363432000162 |
oct | 1327503533446104 |
9 | 216035172036673 |
10 | 50002503027780 |
11 | 14a28a4043a996 |
12 | 57369a1114770 |
13 | 21b92a61725c4 |
14 | c4c1c3c06232 |
15 | 5baa2e787a20 |
hex | 2d7a1d6e4c44 |
50002503027780 has 96 divisors (see below), whose sum is σ = 145562438125440. Its totient is φ = 12814620318720.
The previous prime is 50002503027767. The next prime is 50002503027839. The reversal of 50002503027780 is 8772030520005.
50002503027780 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151523395 + ... + 151853034.
It is an arithmetic number, because the mean of its divisors is an integer number (1516275397140).
Almost surely, 250002503027780 is an apocalyptic number.
It is an amenable number.
50002503027780 is an abundant number, since it is smaller than the sum of its proper divisors (95559935097660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50002503027780 is a wasteful number, since it uses less digits than its factorization.
50002503027780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303376549 (or 303376547 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 39.
Adding to 50002503027780 its reverse (8772030520005), we get a palindrome (58774533547785).
The spelling of 50002503027780 in words is "fifty trillion, two billion, five hundred three million, twenty-seven thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •