Base | Representation |
---|---|
bin | 11110011111100001001… |
… | …11100111010001100001 |
3 | 10201011022222200012110022 |
4 | 33033300213213101201 |
5 | 114131204234003444 |
6 | 2121151350243225 |
7 | 135460220541053 |
oct | 17176047472141 |
9 | 3634288605408 |
10 | 1047713969249 |
11 | 374373249232 |
12 | 14b079356515 |
13 | 77a5054483c |
14 | 389d13038d3 |
15 | 1c3c05989ee |
hex | f3f09e7461 |
1047713969249 has 2 divisors, whose sum is σ = 1047713969250. Its totient is φ = 1047713969248.
The previous prime is 1047713969191. The next prime is 1047713969251. The reversal of 1047713969249 is 9429693177401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 786804480400 + 260909488849 = 887020^2 + 510793^2 .
It is a cyclic number.
It is not a de Polignac number, because 1047713969249 - 28 = 1047713968993 is a prime.
It is a super-2 number, since 2×10477139692492 (a number of 25 digits) contains 22 as substring.
Together with 1047713969251, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1047713969191 and 1047713969200.
It is not a weakly prime, because it can be changed into another prime (1047713962249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 523856984624 + 523856984625.
It is an arithmetic number, because the mean of its divisors is an integer number (523856984625).
Almost surely, 21047713969249 is an apocalyptic number.
It is an amenable number.
1047713969249 is a deficient number, since it is larger than the sum of its proper divisors (1).
1047713969249 is an equidigital number, since it uses as much as digits as its factorization.
1047713969249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20575296, while the sum is 62.
The spelling of 1047713969249 in words is "one trillion, forty-seven billion, seven hundred thirteen million, nine hundred sixty-nine thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •