Base | Representation |
---|---|
bin | 1001100000111011… |
… | …11011100010111101 |
3 | 111011222211100222001 |
4 | 10300131323202331 |
5 | 40430134312431 |
6 | 2202512422301 |
7 | 240404205244 |
oct | 46035734275 |
9 | 14158740861 |
10 | 5108119741 |
11 | 2191444a6a |
12 | ba6847991 |
13 | 63538617a |
14 | 3665a795b |
15 | 1ed6b1e61 |
hex | 13077b8bd |
5108119741 has 2 divisors, whose sum is σ = 5108119742. Its totient is φ = 5108119740.
The previous prime is 5108119717. The next prime is 5108119781. The reversal of 5108119741 is 1479118015.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5053788100 + 54331641 = 71090^2 + 7371^2 .
It is a cyclic number.
It is not a de Polignac number, because 5108119741 - 29 = 5108119229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5108119741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5108119781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2554059870 + 2554059871.
It is an arithmetic number, because the mean of its divisors is an integer number (2554059871).
Almost surely, 25108119741 is an apocalyptic number.
It is an amenable number.
5108119741 is a deficient number, since it is larger than the sum of its proper divisors (1).
5108119741 is an equidigital number, since it uses as much as digits as its factorization.
5108119741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 37.
The square root of 5108119741 is about 71471.1112338405. Note that the first 3 decimals coincide. The cubic root of 5108119741 is about 1722.2136340866.
The spelling of 5108119741 in words is "five billion, one hundred eight million, one hundred nineteen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •