Base | Representation |
---|---|
bin | 101101100010001… |
… | …100010011111001 |
3 | 1222020111001222112 |
4 | 231202030103321 |
5 | 3031032004131 |
6 | 203445502105 |
7 | 24634236416 |
oct | 5542142371 |
9 | 1866431875 |
10 | 763938041 |
11 | 36224aa59 |
12 | 193a11935 |
13 | c2367959 |
14 | 7365d10d |
15 | 4710202b |
hex | 2d88c4f9 |
763938041 has 2 divisors, whose sum is σ = 763938042. Its totient is φ = 763938040.
The previous prime is 763937989. The next prime is 763938079. The reversal of 763938041 is 140839367.
763938041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 436183225 + 327754816 = 20885^2 + 18104^2 .
It is an emirp because it is prime and its reverse (140839367) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-763938041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 763938041.
It is not a weakly prime, because it can be changed into another prime (763938541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 381969020 + 381969021.
It is an arithmetic number, because the mean of its divisors is an integer number (381969021).
Almost surely, 2763938041 is an apocalyptic number.
It is an amenable number.
763938041 is a deficient number, since it is larger than the sum of its proper divisors (1).
763938041 is an equidigital number, since it uses as much as digits as its factorization.
763938041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 41.
The square root of 763938041 is about 27639.4291004717. The cubic root of 763938041 is about 914.1540315174.
The spelling of 763938041 in words is "seven hundred sixty-three million, nine hundred thirty-eight thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •