Base | Representation |
---|---|
bin | 10000000110111001010000… |
… | …011000000110000001000001 |
3 | 100021211110222100112100110201 |
4 | 100012321100120012001001 |
5 | 33241141010000323401 |
6 | 410400340235525201 |
7 | 20631130105423561 |
oct | 2006712030060101 |
9 | 307743870470421 |
10 | 70842539073601 |
11 | 2063317449a499 |
12 | 7b41912bb9801 |
13 | 306b565a96039 |
14 | 136cb2369ada1 |
15 | 82cb9c667b01 |
hex | 406e50606041 |
70842539073601 has 9 divisors (see below), whose sum is σ = 70892241455809. Its totient is φ = 70792871530900.
The previous prime is 70842539073589. The next prime is 70842539073667. The reversal of 70842539073601 is 10637093524807.
The square root of 70842539073601 is 8416801.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 70842539073601 - 211 = 70842539071553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70842539076601) 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, 20292905466 + ... + 20292908956.
It is a 1-persistent number, because it is pandigital, but 2⋅70842539073601 = 141685078147202 is not.
Almost surely, 270842539073601 is an apocalyptic number.
70842539073601 is the 8416801-st square number.
70842539073601 is the 4208401-st centered octagonal number.
It is an amenable number.
70842539073601 is a deficient number, since it is larger than the sum of its proper divisors (49702382208).
70842539073601 is an frugal number, since it uses more digits than its factorization.
70842539073601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11804 (or 5902 counting only the distinct ones).
The product of its (nonzero) digits is 7620480, while the sum is 55.
The spelling of 70842539073601 in words is "seventy trillion, eight hundred forty-two billion, five hundred thirty-nine million, seventy-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •