Base | Representation |
---|---|
bin | 1001101010011… |
… | …0010100010001 |
3 | 2211020222202111 |
4 | 2122212110101 |
5 | 40333331441 |
6 | 4004345321 |
7 | 1001321605 |
oct | 232462421 |
9 | 84228674 |
10 | 40527121 |
11 | 20970698 |
12 | 116a5241 |
13 | 851c75b |
14 | 554d505 |
15 | 3858081 |
hex | 26a6511 |
40527121 has 2 divisors, whose sum is σ = 40527122. Its totient is φ = 40527120.
The previous prime is 40527107. The next prime is 40527143. The reversal of 40527121 is 12172504.
It is a happy number.
It is an a-pointer prime, because the next prime (40527143) can be obtained adding 40527121 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33177600 + 7349521 = 5760^2 + 2711^2 .
It is a cyclic number.
It is not a de Polignac number, because 40527121 - 221 = 38429969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40527092 and 40527101.
It is not a weakly prime, because it can be changed into another prime (40521121) 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, 20263560 + 20263561.
It is an arithmetic number, because the mean of its divisors is an integer number (20263561).
Almost surely, 240527121 is an apocalyptic number.
It is an amenable number.
40527121 is a deficient number, since it is larger than the sum of its proper divisors (1).
40527121 is an equidigital number, since it uses as much as digits as its factorization.
40527121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 40527121 is about 6366.0915010703. The cubic root of 40527121 is about 343.4909119452.
Adding to 40527121 its reverse (12172504), we get a palindrome (52699625).
The spelling of 40527121 in words is "forty million, five hundred twenty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •