Base | Representation |
---|---|
bin | 110000100010110… |
… | …011100001111011 |
3 | 2002202111100101100 |
4 | 300202303201323 |
5 | 3131443232311 |
6 | 212452022443 |
7 | 26116354311 |
oct | 6042634173 |
9 | 2082440340 |
10 | 814430331 |
11 | 3887a7620 |
12 | 1a8901a23 |
13 | cc966150 |
14 | 7a2440b1 |
15 | 4b777a56 |
hex | 308b387b |
814430331 has 24 divisors (see below), whose sum is σ = 1382065776. Its totient is φ = 455624640.
The previous prime is 814430327. The next prime is 814430341. The reversal of 814430331 is 133034418.
814430331 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 814430331 - 22 = 814430327 is a prime.
It is a super-2 number, since 2×8144303312 = 1326593528105539122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 814430295 and 814430304.
It is not an unprimeable number, because it can be changed into a prime (814430321) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 315120 + ... + 317693.
It is an arithmetic number, because the mean of its divisors is an integer number (57586074).
Almost surely, 2814430331 is an apocalyptic number.
814430331 is a deficient number, since it is larger than the sum of its proper divisors (567635445).
814430331 is a wasteful number, since it uses less digits than its factorization.
814430331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632843 (or 632840 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 814430331 is about 28538.2257857772. The cubic root of 814430331 is about 933.8661772727.
Adding to 814430331 its reverse (133034418), we get a palindrome (947464749).
The spelling of 814430331 in words is "eight hundred fourteen million, four hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •