Base | Representation |
---|---|
bin | 101001100000010000001… |
… | …1100111110010011001101 |
3 | 202012022200202111112121010 |
4 | 1103000200130332103031 |
5 | 1221424311311111323 |
6 | 20044300142355433 |
7 | 1126055622534636 |
oct | 123004034762315 |
9 | 22168622445533 |
10 | 5704261035213 |
11 | 18aa18870aa64 |
12 | 78163558bb79 |
13 | 324ba925a100 |
14 | 15a13295088d |
15 | 9d5aa912c93 |
hex | 5302073e4cd |
5704261035213 has 24 divisors (see below), whose sum is σ = 8235919468128. Its totient is φ = 3510237062592.
The previous prime is 5704261035203. The next prime is 5704261035217. The reversal of 5704261035213 is 3125301624075.
It is not a de Polignac number, because 5704261035213 - 224 = 5704244257997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5704261035217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30177231 + ... + 30365667.
It is an arithmetic number, because the mean of its divisors is an integer number (343163311172).
Almost surely, 25704261035213 is an apocalyptic number.
It is an amenable number.
5704261035213 is a deficient number, since it is larger than the sum of its proper divisors (2531658432915).
5704261035213 is a wasteful number, since it uses less digits than its factorization.
5704261035213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248173 (or 248160 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
Adding to 5704261035213 its reverse (3125301624075), we get a palindrome (8829562659288).
The spelling of 5704261035213 in words is "five trillion, seven hundred four billion, two hundred sixty-one million, thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •