Base | Representation |
---|---|
bin | 10010010101011101100111… |
… | …10101011010111101111101 |
3 | 12021202112122102102102102002 |
4 | 21022232303311122331331 |
5 | 20241100101013231214 |
6 | 221430410034312045 |
7 | 11331005043602222 |
oct | 1112566365327575 |
9 | 167675572372362 |
10 | 40319875133309 |
11 | 11935621415182 |
12 | 4632318728625 |
13 | 19661bcc61b85 |
14 | 9d56c70bb949 |
15 | 49dc2c1ce1de |
hex | 24abb3d5af7d |
40319875133309 has 2 divisors, whose sum is σ = 40319875133310. Its totient is φ = 40319875133308.
The previous prime is 40319875133303. The next prime is 40319875133339. The reversal of 40319875133309 is 90333157891304.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27320713594084 + 12999161539225 = 5226922^2 + 3605435^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40319875133309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40319875133303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20159937566654 + 20159937566655.
It is an arithmetic number, because the mean of its divisors is an integer number (20159937566655).
Almost surely, 240319875133309 is an apocalyptic number.
It is an amenable number.
40319875133309 is a deficient number, since it is larger than the sum of its proper divisors (1).
40319875133309 is an equidigital number, since it uses as much as digits as its factorization.
40319875133309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7348320, while the sum is 56.
The spelling of 40319875133309 in words is "forty trillion, three hundred nineteen billion, eight hundred seventy-five million, one hundred thirty-three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •