Base | Representation |
---|---|
bin | 1001001101010001… |
… | …11100001001111101 |
3 | 110202111120021210012 |
4 | 10212220330021331 |
5 | 40110431434121 |
6 | 2134302353005 |
7 | 233332535642 |
oct | 44650741175 |
9 | 13674507705 |
10 | 4943233661 |
11 | 2107365683 |
12 | b5b58b765 |
13 | 60a174742 |
14 | 34c725dc9 |
15 | 1dde91c5b |
hex | 126a3c27d |
4943233661 has 2 divisors, whose sum is σ = 4943233662. Its totient is φ = 4943233660.
The previous prime is 4943233643. The next prime is 4943233679. The reversal of 4943233661 is 1663323494.
It is a balanced prime because it is at equal distance from previous prime (4943233643) and next prime (4943233679).
It can be written as a sum of positive squares in only one way, i.e., 4932955225 + 10278436 = 70235^2 + 3206^2 .
It is a cyclic number.
It is not a de Polignac number, because 4943233661 - 26 = 4943233597 is a prime.
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 (4943233961) 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, 2471616830 + 2471616831.
It is an arithmetic number, because the mean of its divisors is an integer number (2471616831).
Almost surely, 24943233661 is an apocalyptic number.
It is an amenable number.
4943233661 is a deficient number, since it is larger than the sum of its proper divisors (1).
4943233661 is an equidigital number, since it uses as much as digits as its factorization.
4943233661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 279936, while the sum is 41.
The square root of 4943233661 is about 70308.1336759837. The cubic root of 4943233661 is about 1703.4800293854.
The spelling of 4943233661 in words is "four billion, nine hundred forty-three million, two hundred thirty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •