Base | Representation |
---|---|
bin | 1000000000010011… |
… | …1000111011001101 |
3 | 12112202021120222022 |
4 | 2000010320323031 |
5 | 13400040443024 |
6 | 553115255525 |
7 | 104151130061 |
oct | 20004707315 |
9 | 5482246868 |
10 | 2148765389 |
11 | a02a16271 |
12 | 4bb74a5a5 |
13 | 283233314 |
14 | 165541aa1 |
15 | c899b35e |
hex | 80138ecd |
2148765389 has 2 divisors, whose sum is σ = 2148765390. Its totient is φ = 2148765388.
The previous prime is 2148765373. The next prime is 2148765397. The reversal of 2148765389 is 9835678412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1546455625 + 602309764 = 39325^2 + 24542^2 .
It is a cyclic number.
It is not a de Polignac number, because 2148765389 - 24 = 2148765373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2148765389.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2148765349) 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, 1074382694 + 1074382695.
It is an arithmetic number, because the mean of its divisors is an integer number (1074382695).
Almost surely, 22148765389 is an apocalyptic number.
It is an amenable number.
2148765389 is a deficient number, since it is larger than the sum of its proper divisors (1).
2148765389 is an equidigital number, since it uses as much as digits as its factorization.
2148765389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2903040, while the sum is 53.
The square root of 2148765389 is about 46354.7774129053. Note that the first 3 decimals coincide. The cubic root of 2148765389 is about 1290.4157842870.
The spelling of 2148765389 in words is "two billion, one hundred forty-eight million, seven hundred sixty-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •