Base | Representation |
---|---|
bin | 101111001100111111… |
… | …111111011010111001 |
3 | 11211211020211022011221 |
4 | 233030333333122321 |
5 | 1312300043422121 |
6 | 35141153152041 |
7 | 3442665420052 |
oct | 571477773271 |
9 | 154736738157 |
10 | 50683967161 |
11 | 1a549861773 |
12 | 99a5b5b621 |
13 | 4a19687619 |
14 | 264b4d3729 |
15 | 14b994bb41 |
hex | bccfff6b9 |
50683967161 has 45 divisors (see below), whose sum is σ = 58255183083. Its totient is φ = 44089655040.
The previous prime is 50683967149. The next prime is 50683967167. The reversal of 50683967161 is 16176938605.
It is a happy number.
The square root of 50683967161 is 225131.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 23984407161 + 26699560000 = 154869^2 + 163400^2 .
It is not a de Polignac number, because 50683967161 - 25 = 50683967129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50683967099 and 50683967108.
It is not an unprimeable number, because it can be changed into a prime (50683967167) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 1236194301 + ... + 1236194341.
Almost surely, 250683967161 is an apocalyptic number.
50683967161 is the 225131-st square number.
50683967161 is the 112566-th centered octagonal number.
It is an amenable number.
50683967161 is a deficient number, since it is larger than the sum of its proper divisors (7571215922).
50683967161 is an frugal number, since it uses more digits than its factorization.
50683967161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188 (or 77 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 52.
The spelling of 50683967161 in words is "fifty billion, six hundred eighty-three million, nine hundred sixty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •