Base | Representation |
---|---|
bin | 101111101001110110101… |
… | …000101001100011100101 |
3 | 102121001201100010010202021 |
4 | 233221312220221203211 |
5 | 412123144343301023 |
6 | 10544222450143141 |
7 | 455410331010541 |
oct | 57516650514345 |
9 | 12531640103667 |
10 | 3274755447013 |
11 | 10528a8093746 |
12 | 44a804b81ab1 |
13 | 1a9a6756bc9b |
14 | b46db3d2a21 |
15 | 5a2b5a2535d |
hex | 2fa76a298e5 |
3274755447013 has 2 divisors, whose sum is σ = 3274755447014. Its totient is φ = 3274755447012.
The previous prime is 3274755446983. The next prime is 3274755447031. The reversal of 3274755447013 is 3107445574723.
Together with next prime (3274755447031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2352122197569 + 922633249444 = 1533663^2 + 960538^2 .
It is a cyclic number.
It is not a de Polignac number, because 3274755447013 - 25 = 3274755446981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3274755447713) 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, 1637377723506 + 1637377723507.
It is an arithmetic number, because the mean of its divisors is an integer number (1637377723507).
Almost surely, 23274755447013 is an apocalyptic number.
It is an amenable number.
3274755447013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3274755447013 is an equidigital number, since it uses as much as digits as its factorization.
3274755447013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9878400, while the sum is 52.
The spelling of 3274755447013 in words is "three trillion, two hundred seventy-four billion, seven hundred fifty-five million, four hundred forty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.970 sec. • engine limits •