Base | Representation |
---|---|
bin | 111001010010010… |
… | …100101000101111 |
3 | 2110222111011102102 |
4 | 321102110220233 |
5 | 3432020320211 |
6 | 235211445315 |
7 | 32550152510 |
oct | 7122245057 |
9 | 2428434372 |
10 | 961104431 |
11 | 453577a91 |
12 | 229a5683b |
13 | 12416c261 |
14 | 91904a07 |
15 | 5959ba3b |
hex | 39494a2f |
961104431 has 4 divisors (see below), whose sum is σ = 1098405072. Its totient is φ = 823803792.
The previous prime is 961104409. The next prime is 961104461. The reversal of 961104431 is 134401169.
961104431 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 de Polignac number, because none of the positive numbers 2k-961104431 is a prime.
It is a super-2 number, since 2×9611044312 = 1847443454575667522, 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 = 961104394 and 961104403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (961104461) 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, 68650310 + ... + 68650323.
It is an arithmetic number, because the mean of its divisors is an integer number (274601268).
Almost surely, 2961104431 is an apocalyptic number.
961104431 is a deficient number, since it is larger than the sum of its proper divisors (137300641).
961104431 is a wasteful number, since it uses less digits than its factorization.
961104431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137300640.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 961104431 is about 31001.6843252105. The cubic root of 961104431 is about 986.8629849014.
The spelling of 961104431 in words is "nine hundred sixty-one million, one hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •