Base | Representation |
---|---|
bin | 1001110101001010… |
… | …1101111011101001 |
3 | 20210220121111220212 |
4 | 2131102231323221 |
5 | 20401031222031 |
6 | 1113505230505 |
7 | 122252350265 |
oct | 23522557351 |
9 | 6726544825 |
10 | 2638929641 |
11 | 1134674997 |
12 | 617932435 |
13 | 33095353a |
14 | 1b06970a5 |
15 | 106a2012b |
hex | 9d4adee9 |
2638929641 has 2 divisors, whose sum is σ = 2638929642. Its totient is φ = 2638929640.
The previous prime is 2638929619. The next prime is 2638929673. The reversal of 2638929641 is 1469298362.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1875236416 + 763693225 = 43304^2 + 27635^2 .
It is a cyclic number.
It is not a de Polignac number, because 2638929641 - 218 = 2638667497 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2638929641.
It is not a weakly prime, because it can be changed into another prime (2638949641) 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, 1319464820 + 1319464821.
It is an arithmetic number, because the mean of its divisors is an integer number (1319464821).
Almost surely, 22638929641 is an apocalyptic number.
It is an amenable number.
2638929641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2638929641 is an equidigital number, since it uses as much as digits as its factorization.
2638929641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1119744, while the sum is 50.
The square root of 2638929641 is about 51370.5133417995. The cubic root of 2638929641 is about 1381.8978370742.
The spelling of 2638929641 in words is "two billion, six hundred thirty-eight million, nine hundred twenty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •