Base | Representation |
---|---|
bin | 100101110101011001… |
… | …111000100100100101 |
3 | 10212212012000121220201 |
4 | 211311121320210211 |
5 | 1131144323102003 |
6 | 30355042230501 |
7 | 2635465626406 |
oct | 456531704445 |
9 | 125765017821 |
10 | 40624425253 |
11 | 16257479a75 |
12 | 7a59055431 |
13 | 3aa5550869 |
14 | 1d754b19ad |
15 | 10cb72bb1d |
hex | 975678925 |
40624425253 has 2 divisors, whose sum is σ = 40624425254. Its totient is φ = 40624425252.
The previous prime is 40624425229. The next prime is 40624425263. The reversal of 40624425253 is 35252442604.
40624425253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32163552964 + 8460872289 = 179342^2 + 91983^2 .
It is a cyclic number.
It is not a de Polignac number, because 40624425253 - 29 = 40624424741 is a prime.
It is a super-2 number, since 2×406244252532 (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 (40624425263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20312212626 + 20312212627.
It is an arithmetic number, because the mean of its divisors is an integer number (20312212627).
Almost surely, 240624425253 is an apocalyptic number.
It is an amenable number.
40624425253 is a deficient number, since it is larger than the sum of its proper divisors (1).
40624425253 is an equidigital number, since it uses as much as digits as its factorization.
40624425253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 230400, while the sum is 37.
Adding to 40624425253 its reverse (35252442604), we get a palindrome (75876867857).
The spelling of 40624425253 in words is "forty billion, six hundred twenty-four million, four hundred twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •