Base | Representation |
---|---|
bin | 110000000000110… |
… | …001111101110111 |
3 | 2002010201012101220 |
4 | 300000301331313 |
5 | 3122202323111 |
6 | 211532521423 |
7 | 25650505443 |
oct | 6000617567 |
9 | 2063635356 |
10 | 805511031 |
11 | 3837653a6 |
12 | 1a5920273 |
13 | cab62460 |
14 | 78da1823 |
15 | 4aab4e06 |
hex | 30031f77 |
805511031 has 16 divisors (see below), whose sum is σ = 1159753056. Its totient is φ = 494361216.
The previous prime is 805510999. The next prime is 805511059. The reversal of 805511031 is 130115508.
805511031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 805511031 - 25 = 805510999 is a prime.
It is a super-2 number, since 2×8055110312 = 1297696042125365922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 805510992 and 805511010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (805511071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13140 + ... + 42233.
It is an arithmetic number, because the mean of its divisors is an integer number (72484566).
Almost surely, 2805511031 is an apocalyptic number.
805511031 is a deficient number, since it is larger than the sum of its proper divisors (354242025).
805511031 is a wasteful number, since it uses less digits than its factorization.
805511031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55762.
The product of its (nonzero) digits is 600, while the sum is 24.
The square root of 805511031 is about 28381.5262274600. The cubic root of 805511031 is about 930.4445521771. Note that the first 3 decimals are identical.
Adding to 805511031 its reverse (130115508), we get a palindrome (935626539).
The spelling of 805511031 in words is "eight hundred five million, five hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •