Base | Representation |
---|---|
bin | 100101011000001011… |
… | …111110101011110101 |
3 | 10211121000122200112212 |
4 | 211120023332223311 |
5 | 1124143331203023 |
6 | 30234252023205 |
7 | 2620364264006 |
oct | 453013765365 |
9 | 124530580485 |
10 | 40134241013 |
11 | 16025807329 |
12 | 7940a61b05 |
13 | 3a27b24509 |
14 | 1d2a3531ad |
15 | 109d6a1e78 |
hex | 9582feaf5 |
40134241013 has 2 divisors, whose sum is σ = 40134241014. Its totient is φ = 40134241012.
The previous prime is 40134241009. The next prime is 40134241061. The reversal of 40134241013 is 31014243104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24756504964 + 15377736049 = 157342^2 + 124007^2 .
It is a cyclic number.
It is not a de Polignac number, because 40134241013 - 22 = 40134241009 is a prime.
It is a super-2 number, since 2×401342410132 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 40134241013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40134241073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20067120506 + 20067120507.
It is an arithmetic number, because the mean of its divisors is an integer number (20067120507).
Almost surely, 240134241013 is an apocalyptic number.
It is an amenable number.
40134241013 is a deficient number, since it is larger than the sum of its proper divisors (1).
40134241013 is an equidigital number, since it uses as much as digits as its factorization.
40134241013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 40134241013 its reverse (31014243104), we get a palindrome (71148484117).
The spelling of 40134241013 in words is "forty billion, one hundred thirty-four million, two hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •