Base | Representation |
---|---|
bin | 110000000011001… |
… | …001011100001111 |
3 | 2002011212201111011 |
4 | 300003021130033 |
5 | 3122332201341 |
6 | 211554110051 |
7 | 25656001345 |
oct | 6003113417 |
9 | 2064781434 |
10 | 806131471 |
11 | 384049562 |
12 | 1a5b7b327 |
13 | cb01b992 |
14 | 790c3995 |
15 | 4ab88b81 |
hex | 300c970f |
806131471 has 16 divisors (see below), whose sum is σ = 849353728. Its totient is φ = 764121600.
The previous prime is 806131453. The next prime is 806131489. The reversal of 806131471 is 174131608.
It is an interprime number because it is at equal distance from previous prime (806131453) and next prime (806131489).
It is not a de Polignac number, because 806131471 - 27 = 806131343 is a prime.
It is a super-3 number, since 3×8061314713 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (806131421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 399856 + ... + 401866.
It is an arithmetic number, because the mean of its divisors is an integer number (53084608).
Almost surely, 2806131471 is an apocalyptic number.
806131471 is a deficient number, since it is larger than the sum of its proper divisors (43222257).
806131471 is a wasteful number, since it uses less digits than its factorization.
806131471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2302.
The product of its (nonzero) digits is 4032, while the sum is 31.
The square root of 806131471 is about 28392.4544729757. The cubic root of 806131471 is about 930.6833806319.
The spelling of 806131471 in words is "eight hundred six million, one hundred thirty-one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •