Base | Representation |
---|---|
bin | 111001010011001… |
… | …100000011100111 |
3 | 2110222220200210211 |
4 | 321103030003213 |
5 | 3432100101211 |
6 | 235220400251 |
7 | 32552116354 |
oct | 7123140347 |
9 | 2428820724 |
10 | 961331431 |
11 | 453712595 |
12 | 229b46087 |
13 | 12421b688 |
14 | 9196362b |
15 | 595e3e21 |
hex | 394cc0e7 |
961331431 has 4 divisors (see below), whose sum is σ = 961551864. Its totient is φ = 961111000.
The previous prime is 961331381. The next prime is 961331479. The reversal of 961331431 is 134133169.
961331431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 961331431 - 27 = 961331303 is a prime.
It is a super-2 number, since 2×9613314312 = 1848316240457015522, 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 = 961331393 and 961331402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (961332431) 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, 103540 + ... + 112441.
It is an arithmetic number, because the mean of its divisors is an integer number (240387966).
Almost surely, 2961331431 is an apocalyptic number.
961331431 is a deficient number, since it is larger than the sum of its proper divisors (220433).
961331431 is a wasteful number, since it uses less digits than its factorization.
961331431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220432.
The product of its digits is 5832, while the sum is 31.
The square root of 961331431 is about 31005.3452004650. The cubic root of 961331431 is about 986.9406733940.
The spelling of 961331431 in words is "nine hundred sixty-one million, three hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •