Base | Representation |
---|---|
bin | 100101101111011111… |
… | …100000010011000001 |
3 | 10212121021101021000012 |
4 | 211233133200103001 |
5 | 1130443430013033 |
6 | 30341140234305 |
7 | 2633152550216 |
oct | 455737402301 |
9 | 125537337005 |
10 | 40525235393 |
11 | 16206491185 |
12 | 7a2b99b995 |
13 | 3a8ab31a36 |
14 | 1d66251b0d |
15 | 10c2b87248 |
hex | 96f7e04c1 |
40525235393 has 2 divisors, whose sum is σ = 40525235394. Its totient is φ = 40525235392.
The previous prime is 40525235327. The next prime is 40525235447. The reversal of 40525235393 is 39353252504.
40525235393 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., 22304825104 + 18220410289 = 149348^2 + 134983^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40525235393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40525235393.
It is not a weakly prime, because it can be changed into another prime (40525235893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20262617696 + 20262617697.
It is an arithmetic number, because the mean of its divisors is an integer number (20262617697).
Almost surely, 240525235393 is an apocalyptic number.
It is an amenable number.
40525235393 is a deficient number, since it is larger than the sum of its proper divisors (1).
40525235393 is an equidigital number, since it uses as much as digits as its factorization.
40525235393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486000, while the sum is 41.
Adding to 40525235393 its reverse (39353252504), we get a palindrome (79878487897).
The spelling of 40525235393 in words is "forty billion, five hundred twenty-five million, two hundred thirty-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •