Base | Representation |
---|---|
bin | 111100111001010… |
… | …0100110011001101 |
3 | 12021101211110010101 |
4 | 1321302210303031 |
5 | 13141041113234 |
6 | 534431011101 |
7 | 101430525655 |
oct | 17162446315 |
9 | 5241743111 |
10 | 2043301069 |
11 | 959432377 |
12 | 490369a91 |
13 | 2674285b4 |
14 | 15552b365 |
15 | be5b7814 |
hex | 79ca4ccd |
2043301069 has 2 divisors, whose sum is σ = 2043301070. Its totient is φ = 2043301068.
The previous prime is 2043301067. The next prime is 2043301093. The reversal of 2043301069 is 9601033402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1601040169 + 442260900 = 40013^2 + 21030^2 .
It is a cyclic number.
It is not a de Polignac number, because 2043301069 - 21 = 2043301067 is a prime.
It is a super-2 number, since 2×20433010692 = 8350158517153085522, which contains 22 as substring.
Together with 2043301067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2043301067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1021650534 + 1021650535.
It is an arithmetic number, because the mean of its divisors is an integer number (1021650535).
Almost surely, 22043301069 is an apocalyptic number.
It is an amenable number.
2043301069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2043301069 is an equidigital number, since it uses as much as digits as its factorization.
2043301069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 2043301069 is about 45202.8878391636. The cubic root of 2043301069 is about 1268.9488624072.
The spelling of 2043301069 in words is "two billion, forty-three million, three hundred one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •