Base | Representation |
---|---|
bin | 1001100000100011… |
… | …01011011000110111 |
3 | 111011202210012001102 |
4 | 10300101223120313 |
5 | 40423324022311 |
6 | 2202315520315 |
7 | 240335000132 |
oct | 46021533067 |
9 | 14152705042 |
10 | 5104907831 |
11 | 218a6508a1 |
12 | ba575909b |
13 | 63480022a |
14 | 365dad219 |
15 | 1ed27a43b |
hex | 13046b637 |
5104907831 has 4 divisors (see below), whose sum is σ = 5105053464. Its totient is φ = 5104762200.
The previous prime is 5104907813. The next prime is 5104907861. The reversal of 5104907831 is 1387094015.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1387094015 = 5 ⋅277418803.
It is a cyclic number.
It is not a de Polignac number, because 5104907831 - 218 = 5104645687 is a prime.
It is a super-2 number, since 2×51049078312 = 52120167926010249122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5104907861) 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, 15341 + ... + 102201.
It is an arithmetic number, because the mean of its divisors is an integer number (1276263366).
Almost surely, 25104907831 is an apocalyptic number.
5104907831 is a deficient number, since it is larger than the sum of its proper divisors (145633).
5104907831 is an equidigital number, since it uses as much as digits as its factorization.
5104907831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145632.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 5104907831 is about 71448.6377126954. The cubic root of 5104907831 is about 1721.8525909322.
The spelling of 5104907831 in words is "five billion, one hundred four million, nine hundred seven thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •