Base | Representation |
---|---|
bin | 1100000101110… |
… | …0100111010101 |
3 | 10112102101102002 |
4 | 3001130213111 |
5 | 100440222442 |
6 | 5010525045 |
7 | 1154015321 |
oct | 301344725 |
9 | 115371362 |
10 | 50710997 |
11 | 26696a17 |
12 | 14b96785 |
13 | a676c0c |
14 | 6a40981 |
15 | 46ba732 |
hex | 305c9d5 |
50710997 has 2 divisors, whose sum is σ = 50710998. Its totient is φ = 50710996.
The previous prime is 50710993. The next prime is 50711039. The reversal of 50710997 is 79901705.
50710997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29495761 + 21215236 = 5431^2 + 4606^2 .
It is a cyclic number.
It is not a de Polignac number, because 50710997 - 22 = 50710993 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50710997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50710993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25355498 + 25355499.
It is an arithmetic number, because the mean of its divisors is an integer number (25355499).
Almost surely, 250710997 is an apocalyptic number.
It is an amenable number.
50710997 is a deficient number, since it is larger than the sum of its proper divisors (1).
50710997 is an equidigital number, since it uses as much as digits as its factorization.
50710997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19845, while the sum is 38.
The square root of 50710997 is about 7121.1654242827. The cubic root of 50710997 is about 370.1411611366.
The spelling of 50710997 in words is "fifty million, seven hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •