Base | Representation |
---|---|
bin | 101000111100101100100… |
… | …111000111010010110001 |
3 | 100222000022011012010212212 |
4 | 220330230213013102301 |
5 | 332100433204423443 |
6 | 5552413421501505 |
7 | 410205232414025 |
oct | 50745447072261 |
9 | 10860264163785 |
10 | 2813952029873 |
11 | 99543261a086 |
12 | 395442a11895 |
13 | 17547bbc540a |
14 | 9a2a5ba2385 |
15 | 4d2e60c9618 |
hex | 28f2c9c74b1 |
2813952029873 has 2 divisors, whose sum is σ = 2813952029874. Its totient is φ = 2813952029872.
The previous prime is 2813952029869. The next prime is 2813952029929. The reversal of 2813952029873 is 3789202593182.
2813952029873 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., 2430459174049 + 383492855824 = 1558993^2 + 619268^2 .
It is a cyclic number.
It is not a de Polignac number, because 2813952029873 - 22 = 2813952029869 is a prime.
It is a super-2 number, since 2×28139520298732 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2813952029843) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1406976014936 + 1406976014937.
It is an arithmetic number, because the mean of its divisors is an integer number (1406976014937).
Almost surely, 22813952029873 is an apocalyptic number.
It is an amenable number.
2813952029873 is a deficient number, since it is larger than the sum of its proper divisors (1).
2813952029873 is an equidigital number, since it uses as much as digits as its factorization.
2813952029873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 2813952029873 in words is "two trillion, eight hundred thirteen billion, nine hundred fifty-two million, twenty-nine thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •