Base | Representation |
---|---|
bin | 1001010101100111… |
… | …10110000010000111 |
3 | 110221101012222222021 |
4 | 10222303312002013 |
5 | 40231334413111 |
6 | 2145242144011 |
7 | 235142335306 |
oct | 45263660207 |
9 | 13841188867 |
10 | 5013201031 |
11 | 2142904153 |
12 | b7aab2007 |
13 | 61b801457 |
14 | 357b3a43d |
15 | 1e51b2d71 |
hex | 12acf6087 |
5013201031 has 4 divisors (see below), whose sum is σ = 5098170600. Its totient is φ = 4928231464.
The previous prime is 5013201023. The next prime is 5013201073. The reversal of 5013201031 is 1301023105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5013201031 - 23 = 5013201023 is a prime.
It is a super-2 number, since 2×50132010312 = 50264369154438925922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5013200996 and 5013201014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5013201731) 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, 42484696 + ... + 42484813.
It is an arithmetic number, because the mean of its divisors is an integer number (1274542650).
Almost surely, 25013201031 is an apocalyptic number.
5013201031 is a deficient number, since it is larger than the sum of its proper divisors (84969569).
5013201031 is an equidigital number, since it uses as much as digits as its factorization.
5013201031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84969568.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 5013201031 is about 70803.9619724772. The cubic root of 5013201031 is about 1711.4795205691.
Adding to 5013201031 its reverse (1301023105), we get a palindrome (6314224136).
The spelling of 5013201031 in words is "five billion, thirteen million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •