Base | Representation |
---|---|
bin | 100000101010000100… |
… | …1001001100011000001 |
3 | 20201000120011010022211 |
4 | 1001110021021203001 |
5 | 2122112034130111 |
6 | 52115014102121 |
7 | 5031626015026 |
oct | 1012411114301 |
9 | 221016133284 |
10 | 70131161281 |
11 | 27819237525 |
12 | 1171294a941 |
13 | 67c867b88c |
14 | 35741d954d |
15 | 1c56dbd521 |
hex | 10542498c1 |
70131161281 has 4 divisors (see below), whose sum is σ = 70195326292. Its totient is φ = 70066996272.
The previous prime is 70131161273. The next prime is 70131161291. The reversal of 70131161281 is 18216113107.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35497951281 + 34633210000 = 188409^2 + 186100^2 .
It is a cyclic number.
It is not a de Polignac number, because 70131161281 - 23 = 70131161273 is a prime.
It is a super-2 number, since 2×701311612812 (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 (70131161251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32080866 + ... + 32083051.
It is an arithmetic number, because the mean of its divisors is an integer number (17548831573).
Almost surely, 270131161281 is an apocalyptic number.
It is an amenable number.
70131161281 is a deficient number, since it is larger than the sum of its proper divisors (64165011).
70131161281 is a wasteful number, since it uses less digits than its factorization.
70131161281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64165010.
The product of its (nonzero) digits is 2016, while the sum is 31.
Adding to 70131161281 its reverse (18216113107), we get a palindrome (88347274388).
The spelling of 70131161281 in words is "seventy billion, one hundred thirty-one million, one hundred sixty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •