Base | Representation |
---|---|
bin | 1001111010111100… |
… | …00110010011011101 |
3 | 111202012022102120212 |
4 | 10331132012103131 |
5 | 41402011030423 |
6 | 2240304222205 |
7 | 245663346002 |
oct | 47536062335 |
9 | 14665272525 |
10 | 5326267613 |
11 | 22935a2767 |
12 | 104790a965 |
13 | 66b625854 |
14 | 3875518a9 |
15 | 212903578 |
hex | 13d7864dd |
5326267613 has 2 divisors, whose sum is σ = 5326267614. Its totient is φ = 5326267612.
The previous prime is 5326267589. The next prime is 5326267651. The reversal of 5326267613 is 3167626235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5210962969 + 115304644 = 72187^2 + 10738^2 .
It is a cyclic number.
It is not a de Polignac number, because 5326267613 - 212 = 5326263517 is a prime.
It is a super-3 number, since 3×53262676133 (a number of 30 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5326267673) 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, 2663133806 + 2663133807.
It is an arithmetic number, because the mean of its divisors is an integer number (2663133807).
Almost surely, 25326267613 is an apocalyptic number.
It is an amenable number.
5326267613 is a deficient number, since it is larger than the sum of its proper divisors (1).
5326267613 is an equidigital number, since it uses as much as digits as its factorization.
5326267613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 272160, while the sum is 41.
The square root of 5326267613 is about 72981.2826209570. The cubic root of 5326267613 is about 1746.3890290886.
The spelling of 5326267613 in words is "five billion, three hundred twenty-six million, two hundred sixty-seven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •