Base | Representation |
---|---|
bin | 10110111001111011111100… |
… | …00111110100100110100100 |
3 | 20121100020200222022110200021 |
4 | 23130331332013310212210 |
5 | 23100222104022204001 |
6 | 255043142340124524 |
7 | 13416024445150141 |
oct | 1334757607644644 |
9 | 217306628273607 |
10 | 50369197459876 |
11 | 1505a502931159 |
12 | 5795a7a396744 |
13 | 2214a446370c9 |
14 | c61c4c9353c8 |
15 | 5c5342254ba1 |
hex | 2dcf7e1f49a4 |
50369197459876 has 27 divisors (see below), whose sum is σ = 93636612372289. Its totient is φ = 23703038191808.
The previous prime is 50369197459871. The next prime is 50369197459949. The reversal of 50369197459876 is 67895479196305.
The square root of 50369197459876 is 7097126.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 39214773108900 + 11154424350976 = 6262170^2 + 3339824^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50369197459796 and 50369197459805.
It is not an unprimeable number, because it can be changed into a prime (50369197459871) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 241197915 + ... + 241406653.
Almost surely, 250369197459876 is an apocalyptic number.
50369197459876 is the 7097126-th square number.
It is an amenable number.
50369197459876 is a deficient number, since it is larger than the sum of its proper divisors (43267414912413).
50369197459876 is an frugal number, since it uses more digits than its factorization.
50369197459876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417516 (or 208758 counting only the distinct ones).
The product of its (nonzero) digits is 3086294400, while the sum is 79.
The spelling of 50369197459876 in words is "fifty trillion, three hundred sixty-nine billion, one hundred ninety-seven million, four hundred fifty-nine thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •