Base | Representation |
---|---|
bin | 1010100101100101… |
… | …10111100010100101 |
3 | 112200010111211101201 |
4 | 11102302313202211 |
5 | 43120103034301 |
6 | 2340004322501 |
7 | 260566326553 |
oct | 52262674245 |
9 | 15603454351 |
10 | 5684033701 |
11 | 2457541715 |
12 | 11276a3431 |
13 | 6c779a868 |
14 | 3bcc80bd3 |
15 | 234023201 |
hex | 152cb78a5 |
5684033701 has 2 divisors, whose sum is σ = 5684033702. Its totient is φ = 5684033700.
The previous prime is 5684033699. The next prime is 5684033807. The reversal of 5684033701 is 1073304865.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5647672801 + 36360900 = 75151^2 + 6030^2 .
It is a cyclic number.
It is not a de Polignac number, because 5684033701 - 21 = 5684033699 is a prime.
It is a super-2 number, since 2×56840337012 = 64616478228207514802, which contains 22 as substring.
Together with 5684033699, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5684030701) 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, 2842016850 + 2842016851.
It is an arithmetic number, because the mean of its divisors is an integer number (2842016851).
Almost surely, 25684033701 is an apocalyptic number.
It is an amenable number.
5684033701 is a deficient number, since it is larger than the sum of its proper divisors (1).
5684033701 is an equidigital number, since it uses as much as digits as its factorization.
5684033701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
The square root of 5684033701 is about 75392.5308037872. The cubic root of 5684033701 is about 1784.6465417047.
The spelling of 5684033701 in words is "five billion, six hundred eighty-four million, thirty-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •