Base | Representation |
---|---|
bin | 10110110110100001001011… |
… | …10101001111100111000100 |
3 | 20120221000120000002220010011 |
4 | 23123100211311033213010 |
5 | 23041311042012442024 |
6 | 254513200342040004 |
7 | 13404366155653246 |
oct | 1333204565174704 |
9 | 216830500086104 |
10 | 50251752077764 |
11 | 15014714a95296 |
12 | 5777162119004 |
13 | 2206948793473 |
14 | c5a2aa9ba096 |
15 | 5c226b6b8094 |
hex | 2db425d4f9c4 |
50251752077764 has 12 divisors (see below), whose sum is σ = 88282747329084. Its totient is φ = 25028109983744.
The previous prime is 50251752077753. The next prime is 50251752077767. The reversal of 50251752077764 is 46777025715205.
It can be written as a sum of positive squares in 2 ways, for example, as 42962886033664 + 7288866044100 = 6554608^2 + 2699790^2 .
It is a super-2 number, since 2×502517520777642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50251752077699 and 50251752077708.
It is not an unprimeable number, because it can be changed into a prime (50251752077767) 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, 24441512629 + ... + 24441514684.
It is an arithmetic number, because the mean of its divisors is an integer number (7356895610757).
Almost surely, 250251752077764 is an apocalyptic number.
It is an amenable number.
50251752077764 is a deficient number, since it is larger than the sum of its proper divisors (38030995251320).
50251752077764 is a wasteful number, since it uses less digits than its factorization.
50251752077764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48883027574 (or 48883027572 counting only the distinct ones).
The product of its (nonzero) digits is 28812000, while the sum is 58.
The spelling of 50251752077764 in words is "fifty trillion, two hundred fifty-one billion, seven hundred fifty-two million, seventy-seven thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •