Base | Representation |
---|---|
bin | 1100001001000… |
… | …1111011110101 |
3 | 10112211110222222 |
4 | 3002101323311 |
5 | 101014220042 |
6 | 5015332125 |
7 | 1155615131 |
oct | 302217365 |
9 | 115743888 |
10 | 50929397 |
11 | 26826012 |
12 | 15081045 |
13 | a72244c |
14 | 6a9a3c1 |
15 | 47102d2 |
hex | 3091ef5 |
50929397 has 2 divisors, whose sum is σ = 50929398. Its totient is φ = 50929396.
The previous prime is 50929379. The next prime is 50929441. The reversal of 50929397 is 79392905.
Together with previous prime (50929379) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (50929441) can be obtained adding 50929397 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49688401 + 1240996 = 7049^2 + 1114^2 .
It is a cyclic number.
It is not a de Polignac number, because 50929397 - 210 = 50928373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50929357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25464698 + 25464699.
It is an arithmetic number, because the mean of its divisors is an integer number (25464699).
Almost surely, 250929397 is an apocalyptic number.
It is an amenable number.
50929397 is a deficient number, since it is larger than the sum of its proper divisors (1).
50929397 is an equidigital number, since it uses as much as digits as its factorization.
50929397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 153090, while the sum is 44.
The square root of 50929397 is about 7136.4835178118. The cubic root of 50929397 is about 370.6717696183.
The spelling of 50929397 in words is "fifty million, nine hundred twenty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •