Base | Representation |
---|---|
bin | 1000011101000111… |
… | …00001001000010101 |
3 | 102201100020011122021 |
4 | 10032203201020111 |
5 | 33244011042221 |
6 | 2030225533141 |
7 | 220325133613 |
oct | 41643411025 |
9 | 12640204567 |
10 | 4539159061 |
11 | 1a1a267428 |
12 | a681a41b1 |
13 | 574537648 |
14 | 310bc06b3 |
15 | 1b8776041 |
hex | 10e8e1215 |
4539159061 has 2 divisors, whose sum is σ = 4539159062. Its totient is φ = 4539159060.
The previous prime is 4539159059. The next prime is 4539159133. The reversal of 4539159061 is 1609519354.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4083976836 + 455182225 = 63906^2 + 21335^2 .
It is a cyclic number.
It is not a de Polignac number, because 4539159061 - 21 = 4539159059 is a prime.
Together with 4539159059, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4539158999 and 4539159017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4539159161) 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, 2269579530 + 2269579531.
It is an arithmetic number, because the mean of its divisors is an integer number (2269579531).
Almost surely, 24539159061 is an apocalyptic number.
It is an amenable number.
4539159061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4539159061 is an equidigital number, since it uses as much as digits as its factorization.
4539159061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 43.
The square root of 4539159061 is about 67373.2815068407. The cubic root of 4539159061 is about 1655.7387027971.
The spelling of 4539159061 in words is "four billion, five hundred thirty-nine million, one hundred fifty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •