Base | Representation |
---|---|
bin | 100001010010101110… |
… | …0110100101000100100 |
3 | 20211112121222011210221 |
4 | 1002211130310220210 |
5 | 2132410242213441 |
6 | 52502223454124 |
7 | 5110501536100 |
oct | 1024534645044 |
9 | 224477864727 |
10 | 71495272996 |
11 | 28359243884 |
12 | 11a33757344 |
13 | 6985173184 |
14 | 3663448900 |
15 | 1cd6a248d1 |
hex | 10a5734a24 |
71495272996 has 81 divisors (see below), whose sum is σ = 148173558897. Its totient is φ = 30096968160.
The previous prime is 71495272993. The next prime is 71495273039. The reversal of 71495272996 is 69927259417.
The square root of 71495272996 is 267386.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 4704039396 + 66791233600 = 68586^2 + 258440^2 .
It is a super-2 number, since 2×714952729962 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (71495272993) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 265781550 + ... + 265781818.
Almost surely, 271495272996 is an apocalyptic number.
71495272996 is the 267386-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 71495272996
71495272996 is an abundant number, since it is smaller than the sum of its proper divisors (76678285901).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71495272996 is an equidigital number, since it uses as much as digits as its factorization.
71495272996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698 (or 349 counting only the distinct ones).
The product of its digits is 17146080, while the sum is 61.
The spelling of 71495272996 in words is "seventy-one billion, four hundred ninety-five million, two hundred seventy-two thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •