Base | Representation |
---|---|
bin | 100101010010101001… |
… | …111010000011000001 |
3 | 10211100120000001020012 |
4 | 211102221322003001 |
5 | 1124001101014131 |
6 | 30221134354305 |
7 | 2615156323454 |
oct | 452251720301 |
9 | 124316001205 |
10 | 40041423041 |
11 | 15a88380864 |
12 | 791595b995 |
13 | 3a11826a39 |
14 | 1d1bcb149b |
15 | 109546a52b |
hex | 952a7a0c1 |
40041423041 has 2 divisors, whose sum is σ = 40041423042. Its totient is φ = 40041423040.
The previous prime is 40041422987. The next prime is 40041423043. The reversal of 40041423041 is 14032414004.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25670448400 + 14370974641 = 160220^2 + 119879^2 .
It is a cyclic number.
It is not a de Polignac number, because 40041423041 - 230 = 38967681217 is a prime.
It is a Sophie Germain prime.
Together with 40041423043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40041422998 and 40041423016.
It is not a weakly prime, because it can be changed into another prime (40041423043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20020711520 + 20020711521.
It is an arithmetic number, because the mean of its divisors is an integer number (20020711521).
Almost surely, 240041423041 is an apocalyptic number.
It is an amenable number.
40041423041 is a deficient number, since it is larger than the sum of its proper divisors (1).
40041423041 is an equidigital number, since it uses as much as digits as its factorization.
40041423041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 40041423041 its reverse (14032414004), we get a palindrome (54073837045).
The spelling of 40041423041 in words is "forty billion, forty-one million, four hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •