Base | Representation |
---|---|
bin | 100110101011000101… |
… | …101100001101110011 |
3 | 10222011221210201100112 |
4 | 212223011230031303 |
5 | 1140020411221202 |
6 | 31024255011535 |
7 | 3000013352435 |
oct | 465305541563 |
9 | 128157721315 |
10 | 41525101427 |
11 | 16679923347 |
12 | 806a809bab |
13 | 3bba022c44 |
14 | 201cd66655 |
15 | 113083db52 |
hex | 9ab16c373 |
41525101427 has 2 divisors, whose sum is σ = 41525101428. Its totient is φ = 41525101426.
The previous prime is 41525101403. The next prime is 41525101447. The reversal of 41525101427 is 72410152514.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 41525101427 - 210 = 41525100403 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41525101393 and 41525101402.
It is not a weakly prime, because it can be changed into another prime (41525101447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20762550713 + 20762550714.
It is an arithmetic number, because the mean of its divisors is an integer number (20762550714).
Almost surely, 241525101427 is an apocalyptic number.
41525101427 is a deficient number, since it is larger than the sum of its proper divisors (1).
41525101427 is an equidigital number, since it uses as much as digits as its factorization.
41525101427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11200, while the sum is 32.
The spelling of 41525101427 in words is "forty-one billion, five hundred twenty-five million, one hundred one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •