Base | Representation |
---|---|
bin | 101100111101010101110… |
… | …101001010110001000001 |
3 | 101221100121001202000000112 |
4 | 230331111311022301001 |
5 | 401104320000040123 |
6 | 10323150115401105 |
7 | 436132136224541 |
oct | 54752565126101 |
9 | 11840531660015 |
10 | 3089521486913 |
11 | a91293376904 |
12 | 41a92a5b3195 |
13 | 195457481234 |
14 | a9768433321 |
15 | 55573a9dd78 |
hex | 2cf55d4ac41 |
3089521486913 has 2 divisors, whose sum is σ = 3089521486914. Its totient is φ = 3089521486912.
The previous prime is 3089521486903. The next prime is 3089521486937. The reversal of 3089521486913 is 3196841259803.
It is a happy number.
3089521486913 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., 3057084396304 + 32437090609 = 1748452^2 + 180103^2 .
It is a cyclic number.
It is not a de Polignac number, because 3089521486913 - 210 = 3089521485889 is a prime.
It is a super-2 number, since 2×30895214869132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3089521486903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1544760743456 + 1544760743457.
It is an arithmetic number, because the mean of its divisors is an integer number (1544760743457).
Almost surely, 23089521486913 is an apocalyptic number.
It is an amenable number.
3089521486913 is a deficient number, since it is larger than the sum of its proper divisors (1).
3089521486913 is an equidigital number, since it uses as much as digits as its factorization.
3089521486913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11197440, while the sum is 59.
The spelling of 3089521486913 in words is "three trillion, eighty-nine billion, five hundred twenty-one million, four hundred eighty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •