Base | Representation |
---|---|
bin | 10111001001011010110011… |
… | …10010110100010000111101 |
3 | 20200020002210122001112020222 |
4 | 23210231121302310100331 |
5 | 23132431040430342042 |
6 | 300131401043351125 |
7 | 13502326202351552 |
oct | 1344553162642075 |
9 | 220202718045228 |
10 | 50901163918397 |
11 | 15245076050011 |
12 | 5860ba09824a5 |
13 | 2252c6137c3a0 |
14 | c7d8b540aa29 |
15 | 5d40c944b2d2 |
hex | 2e4b59cb443d |
50901163918397 has 4 divisors (see below), whose sum is σ = 54816638065980. Its totient is φ = 46985689770816.
The previous prime is 50901163918273. The next prime is 50901163918421. The reversal of 50901163918397 is 79381936110905.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3727193192836 + 47173970725561 = 1930594^2 + 6868331^2 .
It is a cyclic number.
It is not a de Polignac number, because 50901163918397 - 238 = 50626286011453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50901163918697) 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, 1957737073772 + ... + 1957737073797.
It is an arithmetic number, because the mean of its divisors is an integer number (13704159516495).
Almost surely, 250901163918397 is an apocalyptic number.
It is an amenable number.
50901163918397 is a deficient number, since it is larger than the sum of its proper divisors (3915474147583).
50901163918397 is a wasteful number, since it uses less digits than its factorization.
50901163918397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3915474147582.
The product of its (nonzero) digits is 11022480, while the sum is 62.
The spelling of 50901163918397 in words is "fifty trillion, nine hundred one billion, one hundred sixty-three million, nine hundred eighteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •