Base | Representation |
---|---|
bin | 10110110111110110010101… |
… | …11001010110101101110001 |
3 | 20121002101120020110021210101 |
4 | 23123323022321112231301 |
5 | 23043033210043202131 |
6 | 254550201134432401 |
7 | 13410605135661100 |
oct | 1333731271265561 |
9 | 217071506407711 |
10 | 50297471069041 |
11 | 150320461910a9 |
12 | 5783ba1362701 |
13 | 220b053632c21 |
14 | c5c5a6928037 |
15 | 5c35452cac61 |
hex | 2dbecae56b71 |
50297471069041 has 9 divisors (see below), whose sum is σ = 58509360830091. Its totient is φ = 43112075506752.
The previous prime is 50297471069029. The next prime is 50297471069057. The reversal of 50297471069041 is 14096017479205.
The square root of 50297471069041 is 7092071.
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., 28701895482225 + 21595575586816 = 5357415^2 + 4647104^2 .
It is not a de Polignac number, because 50297471069041 - 215 = 50297471036273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50297471069071) 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, 49137921 + ... + 50151073.
Almost surely, 250297471069041 is an apocalyptic number.
50297471069041 is the 7092071-st square number.
50297471069041 is the 3546036-th centered octagonal number.
It is an amenable number.
50297471069041 is a deficient number, since it is larger than the sum of its proper divisors (8211889761050).
50297471069041 is an frugal number, since it uses more digits than its factorization.
50297471069041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2026320 (or 1013160 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 55.
The spelling of 50297471069041 in words is "fifty trillion, two hundred ninety-seven billion, four hundred seventy-one million, sixty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •