Base | Representation |
---|---|
bin | 100101101000001110… |
… | …110011000001011101 |
3 | 10212021210011011000201 |
4 | 211220032303001131 |
5 | 1130221233241013 |
6 | 30321105223501 |
7 | 2630143235134 |
oct | 455016630135 |
9 | 125253134021 |
10 | 40403415133 |
11 | 16153746884 |
12 | 79b7031b91 |
13 | 3a6b81b443 |
14 | 1d53dc091b |
15 | 10b71223dd |
hex | 9683b305d |
40403415133 has 2 divisors, whose sum is σ = 40403415134. Its totient is φ = 40403415132.
The previous prime is 40403415121. The next prime is 40403415161. The reversal of 40403415133 is 33151430404.
It is an a-pointer prime, because the next prime (40403415161) can be obtained adding 40403415133 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27120161124 + 13283254009 = 164682^2 + 115253^2 .
It is a cyclic number.
It is not a de Polignac number, because 40403415133 - 233 = 31813480541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40403416133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20201707566 + 20201707567.
It is an arithmetic number, because the mean of its divisors is an integer number (20201707567).
Almost surely, 240403415133 is an apocalyptic number.
It is an amenable number.
40403415133 is a deficient number, since it is larger than the sum of its proper divisors (1).
40403415133 is an equidigital number, since it uses as much as digits as its factorization.
40403415133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 40403415133 its reverse (33151430404), we get a palindrome (73554845537).
The spelling of 40403415133 in words is "forty billion, four hundred three million, four hundred fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •