Base | Representation |
---|---|
bin | 1001100111010000… |
… | …00010100100011001 |
3 | 111022200112010101212 |
4 | 10303220002210121 |
5 | 41032220222333 |
6 | 2212044152505 |
7 | 241616432264 |
oct | 46350024431 |
9 | 14280463355 |
10 | 5161101593 |
11 | 220934201a |
12 | 1000538735 |
13 | 64334688b |
14 | 36d639cdb |
15 | 20317a448 |
hex | 133a02919 |
5161101593 has 2 divisors, whose sum is σ = 5161101594. Its totient is φ = 5161101592.
The previous prime is 5161101559. The next prime is 5161101599. The reversal of 5161101593 is 3951011615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4433828569 + 727273024 = 66587^2 + 26968^2 .
It is a cyclic number.
It is not a de Polignac number, because 5161101593 - 26 = 5161101529 is a prime.
It is not a weakly prime, because it can be changed into another prime (5161101599) 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, 2580550796 + 2580550797.
It is an arithmetic number, because the mean of its divisors is an integer number (2580550797).
Almost surely, 25161101593 is an apocalyptic number.
It is an amenable number.
5161101593 is a deficient number, since it is larger than the sum of its proper divisors (1).
5161101593 is an equidigital number, since it uses as much as digits as its factorization.
5161101593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 32.
The square root of 5161101593 is about 71840.8072964106. The cubic root of 5161101593 is about 1728.1474810583.
The spelling of 5161101593 in words is "five billion, one hundred sixty-one million, one hundred one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •