Base | Representation |
---|---|
bin | 111101101101011… |
… | …0011111111011101 |
3 | 12100022020201020211 |
4 | 1323122303333131 |
5 | 13220040020034 |
6 | 541244412421 |
7 | 102212014165 |
oct | 17332637735 |
9 | 5308221224 |
10 | 2070626269 |
11 | 9728a6188 |
12 | 499547111 |
13 | 26cca4c5a |
14 | 1590015a5 |
15 | c1bb3d64 |
hex | 7b6b3fdd |
2070626269 has 2 divisors, whose sum is σ = 2070626270. Its totient is φ = 2070626268.
The previous prime is 2070626263. The next prime is 2070626279. The reversal of 2070626269 is 9626260702.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1306822500 + 763803769 = 36150^2 + 27637^2 .
It is a cyclic number.
It is not a de Polignac number, because 2070626269 - 215 = 2070593501 is a prime.
It is a super-3 number, since 3×20706262693 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2070626263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1035313134 + 1035313135.
It is an arithmetic number, because the mean of its divisors is an integer number (1035313135).
Almost surely, 22070626269 is an apocalyptic number.
It is an amenable number.
2070626269 is a deficient number, since it is larger than the sum of its proper divisors (1).
2070626269 is an equidigital number, since it uses as much as digits as its factorization.
2070626269 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 40.
The square root of 2070626269 is about 45504.1346363163. The cubic root of 2070626269 is about 1274.5804117732.
The spelling of 2070626269 in words is "two billion, seventy million, six hundred twenty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •