Base | Representation |
---|---|
bin | 1001010101011001… |
… | …00111001000101001 |
3 | 110221020122200002221 |
4 | 10222230213020221 |
5 | 40230343230001 |
6 | 2145133354041 |
7 | 235120250443 |
oct | 45254471051 |
9 | 13836580087 |
10 | 5011305001 |
11 | 214182968a |
12 | b7a338921 |
13 | 61b2b9441 |
14 | 3577a5493 |
15 | 1e4e3b1a1 |
hex | 12ab27229 |
5011305001 has 4 divisors (see below), whose sum is σ = 5093457604. Its totient is φ = 4929152400.
The previous prime is 5011304993. The next prime is 5011305029. The reversal of 5011305001 is 1005031105.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 264095001 + 4747210000 = 16251^2 + 68900^2 .
It is a cyclic number.
It is not a de Polignac number, because 5011305001 - 23 = 5011304993 is a prime.
It is a super-2 number, since 2×50113050012 = 50226355626095220002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5011335001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41076210 + ... + 41076331.
It is an arithmetic number, because the mean of its divisors is an integer number (1273364401).
Almost surely, 25011305001 is an apocalyptic number.
It is an amenable number.
5011305001 is a deficient number, since it is larger than the sum of its proper divisors (82152603).
5011305001 is an equidigital number, since it uses as much as digits as its factorization.
5011305001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82152602.
The product of its (nonzero) digits is 75, while the sum is 16.
The square root of 5011305001 is about 70790.5714131480. The cubic root of 5011305001 is about 1711.2637285912.
Adding to 5011305001 its reverse (1005031105), we get a palindrome (6016336106).
The spelling of 5011305001 in words is "five billion, eleven million, three hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •