Base | Representation |
---|---|
bin | 1000011000100111… |
… | …0000001110011001 |
3 | 12210212002121010212 |
4 | 2012021300032121 |
5 | 14102140010034 |
6 | 1011200220505 |
7 | 106526444366 |
oct | 20611601631 |
9 | 5725077125 |
10 | 2250703769 |
11 | a55511066 |
12 | 52990a735 |
13 | 29b3a51a2 |
14 | 174cb946d |
15 | d28d52ce |
hex | 86270399 |
2250703769 has 2 divisors, whose sum is σ = 2250703770. Its totient is φ = 2250703768.
The previous prime is 2250703753. The next prime is 2250703771. The reversal of 2250703769 is 9673070522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1757286400 + 493417369 = 41920^2 + 22213^2 .
It is a cyclic number.
It is not a de Polignac number, because 2250703769 - 24 = 2250703753 is a prime.
It is a super-2 number, since 2×22507037692 = 10131334911581610722, which contains 22 as substring.
Together with 2250703771, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2250703789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1125351884 + 1125351885.
It is an arithmetic number, because the mean of its divisors is an integer number (1125351885).
Almost surely, 22250703769 is an apocalyptic number.
It is an amenable number.
2250703769 is a deficient number, since it is larger than the sum of its proper divisors (1).
2250703769 is an equidigital number, since it uses as much as digits as its factorization.
2250703769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 41.
The square root of 2250703769 is about 47441.5826991470. The cubic root of 2250703769 is about 1310.5073048291.
The spelling of 2250703769 in words is "two billion, two hundred fifty million, seven hundred three thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •