Base | Representation |
---|---|
bin | 101110110000110011110… |
… | …100001111100001100001 |
3 | 102101012121200100110112022 |
4 | 232300303310033201201 |
5 | 410122224221323442 |
6 | 10500132545511225 |
7 | 451111434466265 |
oct | 56606364174141 |
9 | 12335550313468 |
10 | 3213504870497 |
11 | 10299267a5a79 |
12 | 43a970342515 |
13 | 1a40559bc9bc |
14 | b176a8060a5 |
15 | 588cd5e63d2 |
hex | 2ec33d0f861 |
3213504870497 has 2 divisors, whose sum is σ = 3213504870498. Its totient is φ = 3213504870496.
The previous prime is 3213504870481. The next prime is 3213504870523. The reversal of 3213504870497 is 7940784053123.
3213504870497 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., 2565151388881 + 648353481616 = 1601609^2 + 805204^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213504870497 - 24 = 3213504870481 is a prime.
It is a super-2 number, since 2×32135048704972 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3213501870497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1606752435248 + 1606752435249.
It is an arithmetic number, because the mean of its divisors is an integer number (1606752435249).
Almost surely, 23213504870497 is an apocalyptic number.
It is an amenable number.
3213504870497 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213504870497 is an equidigital number, since it uses as much as digits as its factorization.
3213504870497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5080320, while the sum is 53.
The spelling of 3213504870497 in words is "three trillion, two hundred thirteen billion, five hundred four million, eight hundred seventy thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •