Base | Representation |
---|---|
bin | 1001111101101101… |
… | …10010111101000001 |
3 | 111210211001201201121 |
4 | 10332312302331001 |
5 | 41423434103134 |
6 | 2242454432241 |
7 | 246365106541 |
oct | 47666627501 |
9 | 14724051647 |
10 | 5349519169 |
11 | 22a5733a25 |
12 | 1053662681 |
13 | 6733a6c77 |
14 | 38a685321 |
15 | 214997ab4 |
hex | 13edb2f41 |
5349519169 has 2 divisors, whose sum is σ = 5349519170. Its totient is φ = 5349519168.
The previous prime is 5349519167. The next prime is 5349519209. The reversal of 5349519169 is 9619159435.
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., 4357584144 + 991935025 = 66012^2 + 31495^2 .
It is a cyclic number.
It is not a de Polignac number, because 5349519169 - 21 = 5349519167 is a prime.
It is a super-2 number, since 2×53495191692 = 57234710678996901122, which contains 22 as substring.
Together with 5349519167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5349519167) 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, 2674759584 + 2674759585.
It is an arithmetic number, because the mean of its divisors is an integer number (2674759585).
Almost surely, 25349519169 is an apocalyptic number.
It is an amenable number.
5349519169 is a deficient number, since it is larger than the sum of its proper divisors (1).
5349519169 is an equidigital number, since it uses as much as digits as its factorization.
5349519169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1312200, while the sum is 52.
The square root of 5349519169 is about 73140.4072247345. The cubic root of 5349519169 is about 1748.9265982293.
The spelling of 5349519169 in words is "five billion, three hundred forty-nine million, five hundred nineteen thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •