Base | Representation |
---|---|
bin | 11000000000110… |
… | …00010000001001 |
3 | 112001000111102121 |
4 | 30000120100021 |
5 | 403031112204 |
6 | 31553131241 |
7 | 4664043415 |
oct | 1400302011 |
9 | 461014377 |
10 | 201425929 |
11 | a3777311 |
12 | 57559b21 |
13 | 32966353 |
14 | 1ca73d45 |
15 | 12a3bb54 |
hex | c018409 |
201425929 has 2 divisors, whose sum is σ = 201425930. Its totient is φ = 201425928.
The previous prime is 201425923. The next prime is 201425947. The reversal of 201425929 is 929524102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191185929 + 10240000 = 13827^2 + 3200^2 .
It is a cyclic number.
It is not a de Polignac number, because 201425929 - 211 = 201423881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201425894 and 201425903.
It is not a weakly prime, because it can be changed into another prime (201425923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100712964 + 100712965.
It is an arithmetic number, because the mean of its divisors is an integer number (100712965).
Almost surely, 2201425929 is an apocalyptic number.
It is an amenable number.
201425929 is a deficient number, since it is larger than the sum of its proper divisors (1).
201425929 is an equidigital number, since it uses as much as digits as its factorization.
201425929 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 34.
The square root of 201425929 is about 14192.4602870679. The cubic root of 201425929 is about 586.1900716000.
The spelling of 201425929 in words is "two hundred one million, four hundred twenty-five thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •