Base | Representation |
---|---|
bin | 1010010100001100… |
… | …0011111000111001 |
3 | 21010222102221220012 |
4 | 2211003003320321 |
5 | 21132333334001 |
6 | 1134434111305 |
7 | 125422322444 |
oct | 24503037071 |
9 | 7128387805 |
10 | 2769043001 |
11 | 11a1063a9a |
12 | 65341b535 |
13 | 3518ab7aa |
14 | 1c3a8665b |
15 | 1131722bb |
hex | a50c3e39 |
2769043001 has 2 divisors, whose sum is σ = 2769043002. Its totient is φ = 2769043000.
The previous prime is 2769042971. The next prime is 2769043003. The reversal of 2769043001 is 1003409672.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2766234025 + 2808976 = 52595^2 + 1676^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2769043001 is a prime.
It is a Sophie Germain prime.
Together with 2769043003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2769043003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1384521500 + 1384521501.
It is an arithmetic number, because the mean of its divisors is an integer number (1384521501).
Almost surely, 22769043001 is an apocalyptic number.
It is an amenable number.
2769043001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2769043001 is an equidigital number, since it uses as much as digits as its factorization.
2769043001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
The square root of 2769043001 is about 52621.6970554922. The cubic root of 2769043001 is about 1404.2461225013.
The spelling of 2769043001 in words is "two billion, seven hundred sixty-nine million, forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •