Base | Representation |
---|---|
bin | 100101011111010110… |
… | …000100000100101101 |
3 | 10211220101121120212022 |
4 | 211133112010010231 |
5 | 1124420101400122 |
6 | 30254221515525 |
7 | 2623353055133 |
oct | 453726040455 |
9 | 124811546768 |
10 | 40254325037 |
11 | 16087576223 |
12 | 7975112ba5 |
13 | 3a4697a754 |
14 | 1d3c291753 |
15 | 10a8ec2642 |
hex | 95f58412d |
40254325037 has 2 divisors, whose sum is σ = 40254325038. Its totient is φ = 40254325036.
The previous prime is 40254325031. The next prime is 40254325073. The reversal of 40254325037 is 73052345204.
Together with next prime (40254325073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33340568836 + 6913756201 = 182594^2 + 83149^2 .
It is a cyclic number.
It is not a de Polignac number, because 40254325037 - 216 = 40254259501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40254324988 and 40254325006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40254325031) 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, 20127162518 + 20127162519.
It is an arithmetic number, because the mean of its divisors is an integer number (20127162519).
Almost surely, 240254325037 is an apocalyptic number.
It is an amenable number.
40254325037 is a deficient number, since it is larger than the sum of its proper divisors (1).
40254325037 is an equidigital number, since it uses as much as digits as its factorization.
40254325037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 35.
The spelling of 40254325037 in words is "forty billion, two hundred fifty-four million, three hundred twenty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •