Base | Representation |
---|---|
bin | 1010111010011100… |
… | …11100010011111001 |
3 | 120010022210210011122 |
4 | 11131032130103321 |
5 | 43444403044421 |
6 | 2405215235025 |
7 | 265122653555 |
oct | 53516342371 |
9 | 16108723148 |
10 | 5859034361 |
11 | 25372aa264 |
12 | 1176218a75 |
13 | 724b1104b |
14 | 3d81d6865 |
15 | 2445902ab |
hex | 15d39c4f9 |
5859034361 has 2 divisors, whose sum is σ = 5859034362. Its totient is φ = 5859034360.
The previous prime is 5859034339. The next prime is 5859034399. The reversal of 5859034361 is 1634309585.
5859034361 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4398342400 + 1460691961 = 66320^2 + 38219^2 .
It is a cyclic number.
It is not a de Polignac number, because 5859034361 - 26 = 5859034297 is a prime.
It is not a weakly prime, because it can be changed into another prime (5859034331) 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, 2929517180 + 2929517181.
It is an arithmetic number, because the mean of its divisors is an integer number (2929517181).
Almost surely, 25859034361 is an apocalyptic number.
It is an amenable number.
5859034361 is a deficient number, since it is larger than the sum of its proper divisors (1).
5859034361 is an equidigital number, since it uses as much as digits as its factorization.
5859034361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 44.
The square root of 5859034361 is about 76544.3293850041. The cubic root of 5859034361 is about 1802.7770262818. Note that the first 3 decimals are identical.
The spelling of 5859034361 in words is "five billion, eight hundred fifty-nine million, thirty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •