Base | Representation |
---|---|
bin | 1100000011101… |
… | …0101101000001 |
3 | 10112011022212122 |
4 | 3000322231001 |
5 | 100421301342 |
6 | 5003534025 |
7 | 1152566342 |
oct | 300725501 |
9 | 115138778 |
10 | 50572097 |
11 | 26601624 |
12 | 14b2a315 |
13 | a628924 |
14 | 6a060c9 |
15 | 468e4d2 |
hex | 303ab41 |
50572097 has 2 divisors, whose sum is σ = 50572098. Its totient is φ = 50572096.
The previous prime is 50572079. The next prime is 50572099. The reversal of 50572097 is 79027505.
Together with previous prime (50572079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50566321 + 5776 = 7111^2 + 76^2 .
It is a cyclic number.
It is not a de Polignac number, because 50572097 - 26 = 50572033 is a prime.
Together with 50572099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (50572099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25286048 + 25286049.
It is an arithmetic number, because the mean of its divisors is an integer number (25286049).
Almost surely, 250572097 is an apocalyptic number.
It is an amenable number.
50572097 is a deficient number, since it is larger than the sum of its proper divisors (1).
50572097 is an equidigital number, since it uses as much as digits as its factorization.
50572097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22050, while the sum is 35.
The square root of 50572097 is about 7111.4061197488. The cubic root of 50572097 is about 369.8029069612.
The spelling of 50572097 in words is "fifty million, five hundred seventy-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •