Base | Representation |
---|---|
bin | 10001000001101100… |
… | …10000110011110011 |
3 | 212121001110102222112 |
4 | 20200312100303303 |
5 | 122210100431011 |
6 | 4111015555535 |
7 | 442344321422 |
oct | 104066206363 |
9 | 25531412875 |
10 | 9141030131 |
11 | 3970967262 |
12 | 193138bbab |
13 | b28a5b48c |
14 | 62a0472b9 |
15 | 38778858b |
hex | 220d90cf3 |
9141030131 has 4 divisors (see below), whose sum is σ = 9622137000. Its totient is φ = 8659923264.
The previous prime is 9141030083. The next prime is 9141030167. The reversal of 9141030131 is 1310301419.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9141030131 is a prime.
It is a super-2 number, since 2×91410301312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9141030097 and 9141030106.
It is not an unprimeable number, because it can be changed into a prime (9141036131) 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, 240553406 + ... + 240553443.
It is an arithmetic number, because the mean of its divisors is an integer number (2405534250).
Almost surely, 29141030131 is an apocalyptic number.
9141030131 is a deficient number, since it is larger than the sum of its proper divisors (481106869).
9141030131 is a wasteful number, since it uses less digits than its factorization.
9141030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481106868.
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 9141030131 is about 95608.7345957471. The cubic root of 9141030131 is about 2090.8925417927.
The spelling of 9141030131 in words is "nine billion, one hundred forty-one million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •