Base | Representation |
---|---|
bin | 10110111010110111010000… |
… | …00110001110101000010001 |
3 | 20121110021220011001011202111 |
4 | 23131123220012032220101 |
5 | 23101232312242320121 |
6 | 255105530200345321 |
7 | 13421232522024622 |
oct | 1335335006165021 |
9 | 217407804034674 |
10 | 50401040198161 |
11 | 15071a6326a794 |
12 | 57a0086475241 |
13 | 2217a4a704293 |
14 | c635cd9bda49 |
15 | 5c60a7a2a2e1 |
hex | 2dd6e818ea11 |
50401040198161 has 27 divisors (see below), whose sum is σ = 53372032940379. Its totient is φ = 47588490280800.
The previous prime is 50401040198153. The next prime is 50401040198189. The reversal of 50401040198161 is 16189104010405.
The square root of 50401040198161 is 7099369.
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., 132372996561 + 50268667201600 = 363831^2 + 7090040^2 .
It is not a de Polignac number, because 50401040198161 - 23 = 50401040198153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50401040198141) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 66230013021 + ... + 66230013781.
Almost surely, 250401040198161 is an apocalyptic number.
50401040198161 is the 7099369-th square number.
50401040198161 is the 3549685-th centered octagonal number.
It is an amenable number.
50401040198161 is a deficient number, since it is larger than the sum of its proper divisors (2970992742218).
50401040198161 is an frugal number, since it uses more digits than its factorization.
50401040198161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2542 (or 1271 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 40.
The spelling of 50401040198161 in words is "fifty trillion, four hundred one billion, forty million, one hundred ninety-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •