Base | Representation |
---|---|
bin | 1001100010101… |
… | …1110101000101 |
3 | 2210022111112201 |
4 | 2120223311011 |
5 | 40221303123 |
6 | 3545514501 |
7 | 664132111 |
oct | 230536505 |
9 | 83274481 |
10 | 40025413 |
11 | 2065875a |
12 | 114a2a31 |
13 | 83a529c |
14 | 545c741 |
15 | 37a95ad |
hex | 262bd45 |
40025413 has 2 divisors, whose sum is σ = 40025414. Its totient is φ = 40025412.
The previous prime is 40025411. The next prime is 40025417. The reversal of 40025413 is 31452004.
40025413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38663524 + 1361889 = 6218^2 + 1167^2 .
It is a cyclic number.
It is not a de Polignac number, because 40025413 - 21 = 40025411 is a prime.
Together with 40025411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40025411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20012706 + 20012707.
It is an arithmetic number, because the mean of its divisors is an integer number (20012707).
Almost surely, 240025413 is an apocalyptic number.
It is an amenable number.
40025413 is a deficient number, since it is larger than the sum of its proper divisors (1).
40025413 is an equidigital number, since it uses as much as digits as its factorization.
40025413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 40025413 is about 6326.5640753888. The cubic root of 40025413 is about 342.0676000339.
Adding to 40025413 its reverse (31452004), we get a palindrome (71477417).
The spelling of 40025413 in words is "forty million, twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •