Base | Representation |
---|---|
bin | 10111001001001000000110… |
… | …00000010111100011000001 |
3 | 20200012010212111201212000001 |
4 | 23210210003000113203001 |
5 | 23132300002141342101 |
6 | 300123020135000001 |
7 | 13501522225642045 |
oct | 1344440300274301 |
9 | 220163774655001 |
10 | 50891117918401 |
11 | 15240890377582 |
12 | 585b058509001 |
13 | 225201cca73a7 |
14 | c7d201112025 |
15 | 5d3bdc503901 |
hex | 2e49030178c1 |
50891117918401 has 4 divisors (see below), whose sum is σ = 51279599734704. Its totient is φ = 50502636102100.
The previous prime is 50891117918351. The next prime is 50891117918449. The reversal of 50891117918401 is 10481971119805.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50891117918401 - 217 = 50891117787329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50891117910401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 194240907955 + ... + 194240908216.
It is an arithmetic number, because the mean of its divisors is an integer number (12819899933676).
Almost surely, 250891117918401 is an apocalyptic number.
It is an amenable number.
50891117918401 is a deficient number, since it is larger than the sum of its proper divisors (388481816303).
50891117918401 is a wasteful number, since it uses less digits than its factorization.
50891117918401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388481816302.
The product of its (nonzero) digits is 725760, while the sum is 55.
The spelling of 50891117918401 in words is "fifty trillion, eight hundred ninety-one billion, one hundred seventeen million, nine hundred eighteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •