Base | Representation |
---|---|
bin | 101110110001001100110… |
… | …111010001000101011001 |
3 | 102101020200222002000102102 |
4 | 232301030313101011121 |
5 | 410124104310444341 |
6 | 10500242400413145 |
7 | 451125026360006 |
oct | 56611467210531 |
9 | 12336628060372 |
10 | 3213925093721 |
11 | 102a021a239a1 |
12 | 43aa690171b5 |
13 | 1a40c1a921b4 |
14 | b17aa5528ad |
15 | 58905451c9b |
hex | 2ec4cdd1159 |
3213925093721 has 2 divisors, whose sum is σ = 3213925093722. Its totient is φ = 3213925093720.
The previous prime is 3213925093711. The next prime is 3213925093739. The reversal of 3213925093721 is 1273905293123.
3213925093721 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., 3213913122121 + 11971600 = 1792739^2 + 3460^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213925093721 - 26 = 3213925093657 is a prime.
It is a super-3 number, since 3×32139250937213 (a number of 38 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (3213925093711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1606962546860 + 1606962546861.
It is an arithmetic number, because the mean of its divisors is an integer number (1606962546861).
Almost surely, 23213925093721 is an apocalyptic number.
It is an amenable number.
3213925093721 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213925093721 is an equidigital number, since it uses as much as digits as its factorization.
3213925093721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 612360, while the sum is 47.
The spelling of 3213925093721 in words is "three trillion, two hundred thirteen billion, nine hundred twenty-five million, ninety-three thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •