Base | Representation |
---|---|
bin | 100101100010111101… |
… | …100100101110011001 |
3 | 10212001121210220112012 |
4 | 211202331210232121 |
5 | 1130031120422131 |
6 | 30304230355305 |
7 | 2625020652041 |
oct | 454275445631 |
9 | 125047726465 |
10 | 40315014041 |
11 | 16108857825 |
12 | 79914bbb35 |
13 | 3a564091c3 |
14 | 1d4636c721 |
15 | 10ae4ae52b |
hex | 962f64b99 |
40315014041 has 2 divisors, whose sum is σ = 40315014042. Its totient is φ = 40315014040.
The previous prime is 40315014037. The next prime is 40315014043. The reversal of 40315014041 is 14041051304.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39007830016 + 1307184025 = 197504^2 + 36155^2 .
It is a cyclic number.
It is not a de Polignac number, because 40315014041 - 22 = 40315014037 is a prime.
Together with 40315014043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 40315013998 and 40315014016.
It is not a weakly prime, because it can be changed into another prime (40315014043) 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, 20157507020 + 20157507021.
It is an arithmetic number, because the mean of its divisors is an integer number (20157507021).
Almost surely, 240315014041 is an apocalyptic number.
It is an amenable number.
40315014041 is a deficient number, since it is larger than the sum of its proper divisors (1).
40315014041 is an equidigital number, since it uses as much as digits as its factorization.
40315014041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 40315014041 its reverse (14041051304), we get a palindrome (54356065345).
The spelling of 40315014041 in words is "forty billion, three hundred fifteen million, fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •