Base | Representation |
---|---|
bin | 10110110001101101100000… |
… | …11111010001100010010000 |
3 | 20120100020012111120222211001 |
4 | 23120312300133101202100 |
5 | 23031104301101030320 |
6 | 254305242120031344 |
7 | 13356431003542264 |
oct | 1330666037214220 |
9 | 216306174528731 |
10 | 50086574626960 |
11 | 14a60662693773 |
12 | 574b144602554 |
13 | 21c41b39a74b1 |
14 | c522bb6120a4 |
15 | 5bcd0042120a |
hex | 2d8db07d1890 |
50086574626960 has 40 divisors (see below), whose sum is σ = 116490668122296. Its totient is φ = 20027854433280.
The previous prime is 50086574626937. The next prime is 50086574626973. The reversal of 50086574626960 is 6962647568005.
It can be written as a sum of positive squares in 4 ways, for example, as 7992223010704 + 42094351616256 = 2827052^2 + 6488016^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a hoax number, since the sum of its digits (64) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 50086574626892 and 50086574626901.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105627861 + ... + 106100980.
Almost surely, 250086574626960 is an apocalyptic number.
It is an amenable number.
50086574626960 is an abundant number, since it is smaller than the sum of its proper divisors (66404093495336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50086574626960 is a wasteful number, since it uses less digits than its factorization.
50086574626960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211731811 (or 211731805 counting only the distinct ones).
The product of its (nonzero) digits is 130636800, while the sum is 64.
The spelling of 50086574626960 in words is "fifty trillion, eighty-six billion, five hundred seventy-four million, six hundred twenty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •