Base | Representation |
---|---|
bin | 1001010101010110… |
… | …11101111111011001 |
3 | 110221020002110010122 |
4 | 10222223131333121 |
5 | 40230304133101 |
6 | 2145123123025 |
7 | 235114562123 |
oct | 45253357731 |
9 | 13836073118 |
10 | 5011005401 |
11 | 2141644586 |
12 | b7a213475 |
13 | 61b212c6c |
14 | 357728213 |
15 | 1e4dcc51b |
hex | 12aaddfd9 |
5011005401 has 2 divisors, whose sum is σ = 5011005402. Its totient is φ = 5011005400.
The previous prime is 5011005371. The next prime is 5011005407. The reversal of 5011005401 is 1045001105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5000611225 + 10394176 = 70715^2 + 3224^2 .
It is a cyclic number.
It is not a de Polignac number, because 5011005401 - 210 = 5011004377 is a prime.
It is a super-2 number, since 2×50110054012 = 50220350257702341602, 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 5011005401.
It is not a weakly prime, because it can be changed into another prime (5011005407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505502700 + 2505502701.
It is an arithmetic number, because the mean of its divisors is an integer number (2505502701).
Almost surely, 25011005401 is an apocalyptic number.
It is an amenable number.
5011005401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5011005401 is an equidigital number, since it uses as much as digits as its factorization.
5011005401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 5011005401 is about 70788.4552805046. The cubic root of 5011005401 is about 1711.2296253766.
Adding to 5011005401 its reverse (1045001105), we get a palindrome (6056006506).
The spelling of 5011005401 in words is "five billion, eleven million, five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •