Base | Representation |
---|---|
bin | 1111000011001110… |
… | …0000000010000111 |
3 | 101102120000220120022 |
4 | 3300303200002013 |
5 | 31233222014031 |
6 | 1504515525355 |
7 | 202054465043 |
oct | 36063400207 |
9 | 11376026508 |
10 | 4040032391 |
11 | 179354714a |
12 | 948bb985b |
13 | 4c4cc9c15 |
14 | 2a47b5023 |
15 | 189a3197b |
hex | f0ce0087 |
4040032391 has 2 divisors, whose sum is σ = 4040032392. Its totient is φ = 4040032390.
The previous prime is 4040032343. The next prime is 4040032417. The reversal of 4040032391 is 1932300404.
It is an a-pointer prime, because the next prime (4040032417) can be obtained adding 4040032391 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4040032391 - 222 = 4035838087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4040032391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4040032291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2020016195 + 2020016196.
It is an arithmetic number, because the mean of its divisors is an integer number (2020016196).
Almost surely, 24040032391 is an apocalyptic number.
4040032391 is a deficient number, since it is larger than the sum of its proper divisors (1).
4040032391 is an equidigital number, since it uses as much as digits as its factorization.
4040032391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 4040032391 is about 63561.2491302680. The cubic root of 4040032391 is about 1592.6791048094.
Adding to 4040032391 its reverse (1932300404), we get a palindrome (5972332795).
The spelling of 4040032391 in words is "four billion, forty million, thirty-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •