Base | Representation |
---|---|
bin | 1001111011000101… |
… | …1001101011110101 |
3 | 20212122022112120211 |
4 | 2132301121223311 |
5 | 20423410003024 |
6 | 1120153225421 |
7 | 123003335056 |
oct | 23661315365 |
9 | 6778275524 |
10 | 2663750389 |
11 | 1147688103 |
12 | 624102271 |
13 | 335b33c81 |
14 | 1b3ab872d |
15 | 108cc4594 |
hex | 9ec59af5 |
2663750389 has 2 divisors, whose sum is σ = 2663750390. Its totient is φ = 2663750388.
The previous prime is 2663750377. The next prime is 2663750407. The reversal of 2663750389 is 9830573662.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2318422500 + 345327889 = 48150^2 + 18583^2 .
It is a cyclic number.
It is not a de Polignac number, because 2663750389 - 229 = 2126879477 is a prime.
It is a super-2 number, since 2×26637503892 = 14191132269795302642, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2663750339) 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, 1331875194 + 1331875195.
It is an arithmetic number, because the mean of its divisors is an integer number (1331875195).
Almost surely, 22663750389 is an apocalyptic number.
It is an amenable number.
2663750389 is a deficient number, since it is larger than the sum of its proper divisors (1).
2663750389 is an equidigital number, since it uses as much as digits as its factorization.
2663750389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The square root of 2663750389 is about 51611.5334881652. The cubic root of 2663750389 is about 1386.2168558140.
The spelling of 2663750389 in words is "two billion, six hundred sixty-three million, seven hundred fifty thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •