Base | Representation |
---|---|
bin | 11110011111100111010… |
… | …10110110010010010000 |
3 | 10201011110112222101121211 |
4 | 33033303222312102100 |
5 | 114131310334230231 |
6 | 2121200415225504 |
7 | 135461411550451 |
oct | 17176352662220 |
9 | 3634415871554 |
10 | 1047765148816 |
11 | 37439a1251a1 |
12 | 14b092518294 |
13 | 77a5b023ac9 |
14 | 389d8027128 |
15 | 1c3c4d07eb1 |
hex | f3f3ab6490 |
1047765148816 has 45 divisors (see below), whose sum is σ = 2156627032171. Its totient is φ = 493033197056.
The previous prime is 1047765148811. The next prime is 1047765148847. The reversal of 1047765148816 is 6188415677401.
The square root of 1047765148816 is 1023604.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 610579708816 + 437185440000 = 781396^2 + 661200^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1047765148811) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 69597546 + ... + 69612598.
Almost surely, 21047765148816 is an apocalyptic number.
1047765148816 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1047765148816 is the 1023604-th square number.
It is an amenable number.
1047765148816 is an abundant number, since it is smaller than the sum of its proper divisors (1108861883355).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1047765148816 is an frugal number, since it uses more digits than its factorization.
1047765148816 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30148 (or 15072 counting only the distinct ones).
The product of its (nonzero) digits is 9031680, while the sum is 58.
The spelling of 1047765148816 in words is "one trillion, forty-seven billion, seven hundred sixty-five million, one hundred forty-eight thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •