Base | Representation |
---|---|
bin | 1001010100101011… |
… | …11100110010110001 |
3 | 110220211110212010201 |
4 | 10222111330302301 |
5 | 40222333130101 |
6 | 2144402155201 |
7 | 235015616062 |
oct | 45225746261 |
9 | 13824425121 |
10 | 5005364401 |
11 | 21394413a4 |
12 | b78352b01 |
13 | 619cb94ab |
14 | 356a9a569 |
15 | 1e4665e01 |
hex | 12a57ccb1 |
5005364401 has 2 divisors, whose sum is σ = 5005364402. Its totient is φ = 5005364400.
The previous prime is 5005364393. The next prime is 5005364423. The reversal of 5005364401 is 1044635005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3340724401 + 1664640000 = 57799^2 + 40800^2 .
It is a cyclic number.
It is not a de Polignac number, because 5005364401 - 23 = 5005364393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5005364401.
It is not a weakly prime, because it can be changed into another prime (5005364431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2502682200 + 2502682201.
It is an arithmetic number, because the mean of its divisors is an integer number (2502682201).
Almost surely, 25005364401 is an apocalyptic number.
It is an amenable number.
5005364401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5005364401 is an equidigital number, since it uses as much as digits as its factorization.
5005364401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 5005364401 is about 70748.5999932154. The cubic root of 5005364401 is about 1710.5872612183.
Adding to 5005364401 its reverse (1044635005), we get a palindrome (6049999406).
The spelling of 5005364401 in words is "five billion, five million, three hundred sixty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •