Base | Representation |
---|---|
bin | 1000011100101… |
… | …01010111111111 |
3 | 11221100101110122 |
4 | 10032111113333 |
5 | 121120211211 |
6 | 11010525155 |
7 | 1520232446 |
oct | 416252777 |
9 | 157311418 |
10 | 70866431 |
11 | 37002aa9 |
12 | 1b8967bb |
13 | 118b2ccc |
14 | 95a9d5d |
15 | 634c6db |
hex | 43955ff |
70866431 has 4 divisors (see below), whose sum is σ = 70883472. Its totient is φ = 70849392.
The previous prime is 70866413. The next prime is 70866437. The reversal of 70866431 is 13466807.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 70866431 - 214 = 70850047 is a prime.
It is a super-2 number, since 2×708664312 = 10044102085355522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 70866391 and 70866400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70866437) 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 3 ways as a sum of consecutive naturals, for example, 2291 + ... + 12123.
It is an arithmetic number, because the mean of its divisors is an integer number (17720868).
Almost surely, 270866431 is an apocalyptic number.
70866431 is a deficient number, since it is larger than the sum of its proper divisors (17041).
70866431 is an equidigital number, since it uses as much as digits as its factorization.
70866431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17040.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 70866431 is about 8418.2201800618. The cubic root of 70866431 is about 413.8219476747.
The spelling of 70866431 in words is "seventy million, eight hundred sixty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •