Base | Representation |
---|---|
bin | 101110101100100101… |
… | …110001111000101001 |
3 | 11210102100200100020210 |
4 | 232230211301320221 |
5 | 1310141344200230 |
6 | 35011211011333 |
7 | 3423343611120 |
oct | 565445617051 |
9 | 153370610223 |
10 | 50140225065 |
11 | 1a29a939237 |
12 | 9873a39b49 |
13 | 4960b28638 |
14 | 25d91d2ab7 |
15 | 1486d42eb0 |
hex | bac971e29 |
50140225065 has 32 divisors (see below), whose sum is σ = 94642569216. Its totient is φ = 22181849280.
The previous prime is 50140225061. The next prime is 50140225081. The reversal of 50140225065 is 56052204105.
It is not a de Polignac number, because 50140225065 - 22 = 50140225061 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50140225061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7698777 + ... + 7705286.
It is an arithmetic number, because the mean of its divisors is an integer number (2957580288).
Almost surely, 250140225065 is an apocalyptic number.
It is an amenable number.
50140225065 is a deficient number, since it is larger than the sum of its proper divisors (44502344151).
50140225065 is a wasteful number, since it uses less digits than its factorization.
50140225065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15404109.
The product of its (nonzero) digits is 12000, while the sum is 30.
The spelling of 50140225065 in words is "fifty billion, one hundred forty million, two hundred twenty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •