Base | Representation |
---|---|
bin | 1001100000001000… |
… | …10110101001110111 |
3 | 111011112012201211110 |
4 | 10300010112221313 |
5 | 40421430240111 |
6 | 2202113010103 |
7 | 240263212056 |
oct | 46004265167 |
9 | 14145181743 |
10 | 5101415031 |
11 | 2188685689 |
12 | ba4553933 |
13 | 633b7949b |
14 | 36574039d |
15 | 1eccda5a6 |
hex | 130116a77 |
5101415031 has 4 divisors (see below), whose sum is σ = 6801886712. Its totient is φ = 3400943352.
The previous prime is 5101415021. The next prime is 5101415083. The reversal of 5101415031 is 1305141015.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5101415031 - 218 = 5101152887 is a prime.
It is a super-2 number, since 2×51014150312 = 52048870637025461922, 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 = 5101414989 and 5101415007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101415021) 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, 850235836 + ... + 850235841.
It is an arithmetic number, because the mean of its divisors is an integer number (1700471678).
Almost surely, 25101415031 is an apocalyptic number.
5101415031 is a deficient number, since it is larger than the sum of its proper divisors (1700471681).
5101415031 is a wasteful number, since it uses less digits than its factorization.
5101415031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700471680.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 5101415031 is about 71424.1907969562. The cubic root of 5101415031 is about 1721.4598016745.
Adding to 5101415031 its reverse (1305141015), we get a palindrome (6406556046).
The spelling of 5101415031 in words is "five billion, one hundred one million, four hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •