Base | Representation |
---|---|
bin | 101111010100001100… |
… | …011110101110000001 |
3 | 11212010122222020021010 |
4 | 233110030132232001 |
5 | 1313021444302401 |
6 | 35201144351133 |
7 | 3445662445152 |
oct | 572414365601 |
9 | 155118866233 |
10 | 50804681601 |
11 | 1a600a11273 |
12 | 9a1a4754a9 |
13 | 4a386a179b |
14 | 265d557929 |
15 | 14c5343ed6 |
hex | bd431eb81 |
50804681601 has 8 divisors (see below), whose sum is σ = 68272958464. Its totient is φ = 33603096240.
The previous prime is 50804681593. The next prime is 50804681651. The reversal of 50804681601 is 10618640805.
50804681601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50804681601 - 23 = 50804681593 is a prime.
It is a super-2 number, since 2×508046816012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 50804681601.
It is not an unprimeable number, because it can be changed into a prime (50804681651) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66672430 + ... + 66673191.
It is an arithmetic number, because the mean of its divisors is an integer number (8534119808).
Almost surely, 250804681601 is an apocalyptic number.
It is an amenable number.
50804681601 is a deficient number, since it is larger than the sum of its proper divisors (17468276863).
50804681601 is a wasteful number, since it uses less digits than its factorization.
50804681601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133345751.
The product of its (nonzero) digits is 46080, while the sum is 39.
The spelling of 50804681601 in words is "fifty billion, eight hundred four million, six hundred eighty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •