Base | Representation |
---|---|
bin | 111000010111000… |
… | …001111000101011 |
3 | 2102220020111000122 |
4 | 320113001320223 |
5 | 3414030424011 |
6 | 233454353455 |
7 | 32301064664 |
oct | 7027017053 |
9 | 2386214018 |
10 | 945561131 |
11 | 445821089 |
12 | 2247bb88b |
13 | 120b89538 |
14 | 8d81a36b |
15 | 5802b3db |
hex | 385c1e2b |
945561131 has 8 divisors (see below), whose sum is σ = 1001767824. Its totient is φ = 889419520.
The previous prime is 945561121. The next prime is 945561137. The reversal of 945561131 is 131165549.
945561131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-945561131 is a prime.
It is a super-2 number, since 2×9455611312 = 1788171704915998322, 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 = 945561091 and 945561100.
It is not an unprimeable number, because it can be changed into a prime (945561137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15431 + ... + 46143.
It is an arithmetic number, because the mean of its divisors is an integer number (125220978).
Almost surely, 2945561131 is an apocalyptic number.
945561131 is a deficient number, since it is larger than the sum of its proper divisors (56206693).
945561131 is a wasteful number, since it uses less digits than its factorization.
945561131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32541.
The product of its digits is 16200, while the sum is 35.
The square root of 945561131 is about 30749.9777398293. The cubic root of 945561131 is about 981.5140870809.
The spelling of 945561131 in words is "nine hundred forty-five million, five hundred sixty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •