Base | Representation |
---|---|
bin | 1100000100001… |
… | …1000101011101 |
3 | 10112020001222012 |
4 | 3001003011131 |
5 | 100423401204 |
6 | 5004401005 |
7 | 1153101416 |
oct | 301030535 |
9 | 115201865 |
10 | 50606429 |
11 | 266253a5 |
12 | 14b46165 |
13 | a63b443 |
14 | 6a1480d |
15 | 469976e |
hex | 304315d |
50606429 has 2 divisors, whose sum is σ = 50606430. Its totient is φ = 50606428.
The previous prime is 50606389. The next prime is 50606431. The reversal of 50606429 is 92460605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39564100 + 11042329 = 6290^2 + 3323^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50606429 is a prime.
It is a super-2 number, since 2×506064292 = 5122021312264082, which contains 22 as substring.
Together with 50606431, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 50606395 and 50606404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50606449) 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, 25303214 + 25303215.
It is an arithmetic number, because the mean of its divisors is an integer number (25303215).
Almost surely, 250606429 is an apocalyptic number.
It is an amenable number.
50606429 is a deficient number, since it is larger than the sum of its proper divisors (1).
50606429 is an equidigital number, since it uses as much as digits as its factorization.
50606429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 50606429 is about 7113.8195788198. The cubic root of 50606429 is about 369.8865710252.
The spelling of 50606429 in words is "fifty million, six hundred six thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •