Base | Representation |
---|---|
bin | 101111010110110101… |
… | …001001011111110001 |
3 | 11212020202011121101211 |
4 | 233112311021133301 |
5 | 1313114304201014 |
6 | 35205404200121 |
7 | 3450040331101 |
oct | 572665113761 |
9 | 155222147354 |
10 | 50848897009 |
11 | 1a623970a29 |
12 | 9a31239041 |
13 | 4a448b2c51 |
14 | 2665387201 |
15 | 14c9179cc4 |
hex | bd6d497f1 |
50848897009 has 9 divisors (see below), whose sum is σ = 51571694433. Its totient is φ = 50136100992.
The previous prime is 50848896991. The next prime is 50848897019. The reversal of 50848897009 is 90079884805.
The square root of 50848897009 is 225497.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 14547978225 + 36300918784 = 120615^2 + 190528^2 .
It is not a de Polignac number, because 50848897009 - 25 = 50848896977 is a prime.
It is a super-3 number, since 3×508488970093 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50848897019) 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, 16459737 + ... + 16462825.
Almost surely, 250848897009 is an apocalyptic number.
50848897009 is the 225497-th square number.
50848897009 is the 112749-th centered octagonal number.
It is an amenable number.
50848897009 is a deficient number, since it is larger than the sum of its proper divisors (722797424).
50848897009 is an frugal number, since it uses more digits than its factorization.
50848897009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6324 (or 3162 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 58.
The spelling of 50848897009 in words is "fifty billion, eight hundred forty-eight million, eight hundred ninety-seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •