Base | Representation |
---|---|
bin | 1110011000111001… |
… | …11001010010101001 |
3 | 201221101010102211201 |
4 | 13030130321102221 |
5 | 111310111002212 |
6 | 3314315324201 |
7 | 362302134052 |
oct | 71434712251 |
9 | 21841112751 |
10 | 7725094057 |
11 | 330468355a |
12 | 15b7150661 |
13 | 9615c0295 |
14 | 533d87729 |
15 | 3032e6b57 |
hex | 1cc7394a9 |
7725094057 has 2 divisors, whose sum is σ = 7725094058. Its totient is φ = 7725094056.
The previous prime is 7725094033. The next prime is 7725094063. The reversal of 7725094057 is 7504905277.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6211961856 + 1513132201 = 78816^2 + 38899^2 .
It is an emirp because it is prime and its reverse (7504905277) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7725094057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 7725093998 and 7725094016.
It is not a weakly prime, because it can be changed into another prime (7725092057) 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, 3862547028 + 3862547029.
It is an arithmetic number, because the mean of its divisors is an integer number (3862547029).
Almost surely, 27725094057 is an apocalyptic number.
It is an amenable number.
7725094057 is a deficient number, since it is larger than the sum of its proper divisors (1).
7725094057 is an equidigital number, since it uses as much as digits as its factorization.
7725094057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 617400, while the sum is 46.
The square root of 7725094057 is about 87892.5142261842. The cubic root of 7725094057 is about 1976.8236369342.
The spelling of 7725094057 in words is "seven billion, seven hundred twenty-five million, ninety-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •