Base | Representation |
---|---|
bin | 1001100000100100… |
… | …01100011010101001 |
3 | 111011210001001121212 |
4 | 10300102030122221 |
5 | 40423342334423 |
6 | 2202322442505 |
7 | 240336102422 |
oct | 46022143251 |
9 | 14153031555 |
10 | 5105043113 |
11 | 218a7334a5 |
12 | ba5803435 |
13 | 634849991 |
14 | 366006649 |
15 | 1ed2a5578 |
hex | 13048c6a9 |
5105043113 has 2 divisors, whose sum is σ = 5105043114. Its totient is φ = 5105043112.
The previous prime is 5105043109. The next prime is 5105043173. The reversal of 5105043113 is 3113405015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3909750784 + 1195292329 = 62528^2 + 34573^2 .
It is a cyclic number.
It is not a de Polignac number, because 5105043113 - 22 = 5105043109 is a prime.
It is a super-2 number, since 2×51050431132 = 52122930371177461538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5105043103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552521556 + 2552521557.
It is an arithmetic number, because the mean of its divisors is an integer number (2552521557).
Almost surely, 25105043113 is an apocalyptic number.
It is an amenable number.
5105043113 is a deficient number, since it is larger than the sum of its proper divisors (1).
5105043113 is an equidigital number, since it uses as much as digits as its factorization.
5105043113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 5105043113 is about 71449.5844144667. The cubic root of 5105043113 is about 1721.8678007141.
Adding to 5105043113 its reverse (3113405015), we get a palindrome (8218448128).
The spelling of 5105043113 in words is "five billion, one hundred five million, forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •