Base | Representation |
---|---|
bin | 10011101100000011… |
… | …10010000000011001 |
3 | 1000021122112101012111 |
4 | 21312001302000121 |
5 | 133121422104144 |
6 | 4504510112321 |
7 | 522636323056 |
oct | 116601620031 |
9 | 30248471174 |
10 | 10570113049 |
11 | 453460a421 |
12 | 206baab6a1 |
13 | cc5b50682 |
14 | 723b6a02d |
15 | 41ce75534 |
hex | 276072019 |
10570113049 has 2 divisors, whose sum is σ = 10570113050. Its totient is φ = 10570113048.
The previous prime is 10570113023. The next prime is 10570113061. The reversal of 10570113049 is 94031107501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8879669824 + 1690443225 = 94232^2 + 41115^2 .
It is a cyclic number.
It is not a de Polignac number, because 10570113049 - 25 = 10570113017 is a prime.
It is a super-2 number, since 2×105701130492 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10570113049.
It is not a weakly prime, because it can be changed into another prime (10570113019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5285056524 + 5285056525.
It is an arithmetic number, because the mean of its divisors is an integer number (5285056525).
Almost surely, 210570113049 is an apocalyptic number.
It is an amenable number.
10570113049 is a deficient number, since it is larger than the sum of its proper divisors (1).
10570113049 is an equidigital number, since it uses as much as digits as its factorization.
10570113049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 31.
The spelling of 10570113049 in words is "ten billion, five hundred seventy million, one hundred thirteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •