Base | Representation |
---|---|
bin | 1001010101000111… |
… | …11110111110000011 |
3 | 110221002101202200101 |
4 | 10222203332332003 |
5 | 40224303341311 |
6 | 2145013103231 |
7 | 235062110605 |
oct | 45243767603 |
9 | 13832352611 |
10 | 5009043331 |
11 | 2140524436 |
12 | b79627b17 |
13 | 61a9a6b86 |
14 | 357377175 |
15 | 1e4b40ec1 |
hex | 12a8fef83 |
5009043331 has 2 divisors, whose sum is σ = 5009043332. Its totient is φ = 5009043330.
The previous prime is 5009043317. The next prime is 5009043343. The reversal of 5009043331 is 1333409005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5009043331 - 27 = 5009043203 is a prime.
It is a super-2 number, since 2×50090433312 = 50181030183671151122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5009043331.
It is not a weakly prime, because it can be changed into another prime (5009043371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2504521665 + 2504521666.
It is an arithmetic number, because the mean of its divisors is an integer number (2504521666).
Almost surely, 25009043331 is an apocalyptic number.
5009043331 is a deficient number, since it is larger than the sum of its proper divisors (1).
5009043331 is an equidigital number, since it uses as much as digits as its factorization.
5009043331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 28.
The square root of 5009043331 is about 70774.5952372742. The cubic root of 5009043331 is about 1711.0062509998.
The spelling of 5009043331 in words is "five billion, nine million, forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •