Base | Representation |
---|---|
bin | 100000111010110101… |
… | …0011011100110000001 |
3 | 20202110202100121210001 |
4 | 1001311222123212001 |
5 | 2124240021042311 |
6 | 52250503440001 |
7 | 5051565060622 |
oct | 1016552334601 |
9 | 222422317701 |
10 | 70693534081 |
11 | 27a87725535 |
12 | 1184b156001 |
13 | 6888031951 |
14 | 35c8b89a49 |
15 | 1c8b4574c1 |
hex | 1075a9b981 |
70693534081 has 8 divisors (see below), whose sum is σ = 71705255400. Its totient is φ = 69687926400.
The previous prime is 70693534049. The next prime is 70693534103. The reversal of 70693534081 is 18043539607.
It can be written as a sum of positive squares in 4 ways, for example, as 49613107600 + 21080426481 = 222740^2 + 145191^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 70693534081 - 25 = 70693534049 is a prime.
It is a super-2 number, since 2×706935340812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70693934081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1505116 + ... + 1551373.
It is an arithmetic number, because the mean of its divisors is an integer number (8963156925).
Almost surely, 270693534081 is an apocalyptic number.
It is an amenable number.
70693534081 is a deficient number, since it is larger than the sum of its proper divisors (1011721319).
70693534081 is a wasteful number, since it uses less digits than its factorization.
70693534081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3056819.
The product of its (nonzero) digits is 544320, while the sum is 46.
The spelling of 70693534081 in words is "seventy billion, six hundred ninety-three million, five hundred thirty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •