Base | Representation |
---|---|
bin | 101010101101001100001… |
… | …011100011101011001001 |
3 | 101101120002010111110110222 |
4 | 222231030023203223021 |
5 | 341040322113330124 |
6 | 10124111251315425 |
7 | 422012416610651 |
oct | 52551413435311 |
9 | 11346063443428 |
10 | 2934740761289 |
11 | a31686718847 |
12 | 3b49328abb75 |
13 | 18398b61855c |
14 | a2083b7d361 |
15 | 5151542d25e |
hex | 2ab4c2e3ac9 |
2934740761289 has 2 divisors, whose sum is σ = 2934740761290. Its totient is φ = 2934740761288.
The previous prime is 2934740761283. The next prime is 2934740761367. The reversal of 2934740761289 is 9821670474392.
2934740761289 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2864776279225 + 69964482064 = 1692565^2 + 264508^2 .
It is a cyclic number.
It is not a de Polignac number, because 2934740761289 - 220 = 2934739712713 is a prime.
It is a super-2 number, since 2×29347407612892 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2934740761283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1467370380644 + 1467370380645.
It is an arithmetic number, because the mean of its divisors is an integer number (1467370380645).
Almost surely, 22934740761289 is an apocalyptic number.
It is an amenable number.
2934740761289 is a deficient number, since it is larger than the sum of its proper divisors (1).
2934740761289 is an equidigital number, since it uses as much as digits as its factorization.
2934740761289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36578304, while the sum is 62.
The spelling of 2934740761289 in words is "two trillion, nine hundred thirty-four billion, seven hundred forty million, seven hundred sixty-one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •