Base | Representation |
---|---|
bin | 10000001011011000011100… |
… | …110101011111011100010000 |
3 | 100022220221221101121121200100 |
4 | 100023120130311133130100 |
5 | 33311214031433310000 |
6 | 411154135554052400 |
7 | 20662324633222434 |
oct | 2013303465373420 |
9 | 308827841547610 |
10 | 71150912010000 |
11 | 20741a28a24839 |
12 | 7b9163457a100 |
13 | 309166b491a84 |
14 | 137da188249c4 |
15 | 835be9e3ba00 |
hex | 40b61cd5f710 |
71150912010000 has 675 divisors, whose sum is σ = 257394339245043. Its totient is φ = 18341281440000.
The previous prime is 71150912009953. The next prime is 71150912010023. The reversal of 71150912010000 is 1021905117.
The square root of 71150912010000 is 8435100.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 5578231501584 + 65572680508416 = 2361828^2 + 8097696^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 78446429547 + ... + 78446430453.
Almost surely, 271150912010000 is an apocalyptic number.
71150912010000 is the 8435100-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 71150912010000
71150912010000 is an abundant number, since it is smaller than the sum of its proper divisors (186243427235043).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71150912010000 is an frugal number, since it uses more digits than its factorization.
71150912010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1910 (or 948 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 27.
Adding to 71150912010000 its reverse (1021905117), we get a palindrome (71151933915117).
The spelling of 71150912010000 in words is "seventy-one trillion, one hundred fifty billion, nine hundred twelve million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •