Base | Representation |
---|---|
bin | 1000001011001110… |
… | …10011110111000101 |
3 | 102022212222100100001 |
4 | 10011213103313011 |
5 | 32442111031331 |
6 | 2003310521301 |
7 | 213524142001 |
oct | 40547236705 |
9 | 12285870301 |
10 | 4389158341 |
11 | 1952624697 |
12 | a25b06231 |
13 | 54c438319 |
14 | 2d8cd5701 |
15 | 1aa4e6561 |
hex | 1059d3dc5 |
4389158341 has 2 divisors, whose sum is σ = 4389158342. Its totient is φ = 4389158340.
The previous prime is 4389158339. The next prime is 4389158351. The reversal of 4389158341 is 1438519834.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4385750625 + 3407716 = 66225^2 + 1846^2 .
It is a cyclic number.
It is not a de Polignac number, because 4389158341 - 21 = 4389158339 is a prime.
Together with 4389158339, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4389158291 and 4389158300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4389158351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2194579170 + 2194579171.
It is an arithmetic number, because the mean of its divisors is an integer number (2194579171).
Almost surely, 24389158341 is an apocalyptic number.
It is an amenable number.
4389158341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4389158341 is an equidigital number, since it uses as much as digits as its factorization.
4389158341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 414720, while the sum is 46.
The square root of 4389158341 is about 66250.7233243532. The cubic root of 4389158341 is about 1637.2955551995.
The spelling of 4389158341 in words is "four billion, three hundred eighty-nine million, one hundred fifty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •