Base | Representation |
---|---|
bin | 1011000001010000… |
… | …00001010010001101 |
3 | 120021022010112210201 |
4 | 11200220001102031 |
5 | 44104003233203 |
6 | 2415013533501 |
7 | 266414526364 |
oct | 54050012215 |
9 | 16238115721 |
10 | 5916071053 |
11 | 2566516822 |
12 | 1191344291 |
13 | 733891279 |
14 | 401a027db |
15 | 2495a9e1d |
hex | 160a0148d |
5916071053 has 2 divisors, whose sum is σ = 5916071054. Its totient is φ = 5916071052.
The previous prime is 5916071033. The next prime is 5916071089. The reversal of 5916071053 is 3501706195.
5916071053 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., 4808312964 + 1107758089 = 69342^2 + 33283^2 .
It is a cyclic number.
It is not a de Polignac number, because 5916071053 - 225 = 5882516621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5916071033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2958035526 + 2958035527.
It is an arithmetic number, because the mean of its divisors is an integer number (2958035527).
Almost surely, 25916071053 is an apocalyptic number.
It is an amenable number.
5916071053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5916071053 is an equidigital number, since it uses as much as digits as its factorization.
5916071053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28350, while the sum is 37.
The square root of 5916071053 is about 76915.9999804982. Note that the first 4 decimals coincide. The cubic root of 5916071053 is about 1808.6080537829.
The spelling of 5916071053 in words is "five billion, nine hundred sixteen million, seventy-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •