Base | Representation |
---|---|
bin | 100101101001110101… |
… | …111111011111000101 |
3 | 10212100200001112020012 |
4 | 211221311333133011 |
5 | 1130300144421023 |
6 | 30323513120005 |
7 | 2630622204446 |
oct | 455165773705 |
9 | 125320045205 |
10 | 40430467013 |
11 | 16167a43302 |
12 | 7a040b9005 |
13 | 3a74300581 |
14 | 1d578232cd |
15 | 10b96b7978 |
hex | 969d7f7c5 |
40430467013 has 2 divisors, whose sum is σ = 40430467014. Its totient is φ = 40430467012.
The previous prime is 40430466929. The next prime is 40430467031. The reversal of 40430467013 is 31076403404.
Together with next prime (40430467031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21568740769 + 18861726244 = 146863^2 + 137338^2 .
It is a cyclic number.
It is not a de Polignac number, because 40430467013 - 216 = 40430401477 is a prime.
It is a super-2 number, since 2×404304670132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40430457013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20215233506 + 20215233507.
It is an arithmetic number, because the mean of its divisors is an integer number (20215233507).
Almost surely, 240430467013 is an apocalyptic number.
It is an amenable number.
40430467013 is a deficient number, since it is larger than the sum of its proper divisors (1).
40430467013 is an equidigital number, since it uses as much as digits as its factorization.
40430467013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 32.
The spelling of 40430467013 in words is "forty billion, four hundred thirty million, four hundred sixty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •