Base | Representation |
---|---|
bin | 101111001010011100… |
… | …110110100010010001 |
3 | 11211201021100120110001 |
4 | 233022130312202101 |
5 | 1312203121420142 |
6 | 35133024410001 |
7 | 3441636052201 |
oct | 571234664221 |
9 | 154637316401 |
10 | 50641201297 |
11 | 1a527702085 |
12 | 9993776901 |
13 | 4a10862b8b |
14 | 2645960401 |
15 | 14b5d005b7 |
hex | bca736891 |
50641201297 has 4 divisors (see below), whose sum is σ = 50768761396. Its totient is φ = 50513641200.
The previous prime is 50641201283. The next prime is 50641201301. The reversal of 50641201297 is 79210214605.
50641201297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 2250362+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 33938482176 + 16702719121 = 184224^2 + 129239^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50641201297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50641201207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63779454 + ... + 63780247.
It is an arithmetic number, because the mean of its divisors is an integer number (12692190349).
Almost surely, 250641201297 is an apocalyptic number.
It is an amenable number.
50641201297 is a deficient number, since it is larger than the sum of its proper divisors (127560099).
50641201297 is a wasteful number, since it uses less digits than its factorization.
50641201297 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127560098.
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 50641201297 in words is "fifty billion, six hundred forty-one million, two hundred one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •