Base | Representation |
---|---|
bin | 1001100000000111… |
… | …00101100000010001 |
3 | 111011111211111200020 |
4 | 10300003211200101 |
5 | 40421402314323 |
6 | 2202104414053 |
7 | 240261413121 |
oct | 46003454021 |
9 | 14144744606 |
10 | 5101213713 |
11 | 2188558402 |
12 | ba4477329 |
13 | 633b0896b |
14 | 3656cac81 |
15 | 1ecc9aae3 |
hex | 1300e5811 |
5101213713 has 4 divisors (see below), whose sum is σ = 6801618288. Its totient is φ = 3400809140.
The previous prime is 5101213703. The next prime is 5101213721. The reversal of 5101213713 is 3173121015.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5101213713 - 210 = 5101212689 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5101213703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850202283 + ... + 850202288.
It is an arithmetic number, because the mean of its divisors is an integer number (1700404572).
Almost surely, 25101213713 is an apocalyptic number.
It is an amenable number.
5101213713 is a deficient number, since it is larger than the sum of its proper divisors (1700404575).
5101213713 is a wasteful number, since it uses less digits than its factorization.
5101213713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700404574.
The product of its (nonzero) digits is 630, while the sum is 24.
The square root of 5101213713 is about 71422.7814706204. The cubic root of 5101213713 is about 1721.4371566239.
Adding to 5101213713 its reverse (3173121015), we get a palindrome (8274334728).
The spelling of 5101213713 in words is "five billion, one hundred one million, two hundred thirteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •