Base | Representation |
---|---|
bin | 1011001011010010… |
… | …0001010000001101 |
3 | 21202002020111011111 |
4 | 2302310201100031 |
5 | 22121012042031 |
6 | 1213410452021 |
7 | 134226350425 |
oct | 26264412015 |
9 | 7662214144 |
10 | 3000112141 |
11 | 12aa537724 |
12 | 6b8894011 |
13 | 38a7235b0 |
14 | 206635485 |
15 | 1285b71b1 |
hex | b2d2140d |
3000112141 has 32 divisors (see below), whose sum is σ = 3522355200. Its totient is φ = 2530491840.
The previous prime is 3000112139. The next prime is 3000112163. The reversal of 3000112141 is 1412110003.
It is a cyclic number.
It is not a de Polignac number, because 3000112141 - 21 = 3000112139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000112441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3575400 + ... + 3576238.
It is an arithmetic number, because the mean of its divisors is an integer number (110073600).
Almost surely, 23000112141 is an apocalyptic number.
3000112141 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3000112141 is a deficient number, since it is larger than the sum of its proper divisors (522243059).
3000112141 is a wasteful number, since it uses less digits than its factorization.
3000112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1369.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 3000112141 is about 54773.2794435389. The cubic root of 3000112141 is about 1442.2675406734.
Adding to 3000112141 its reverse (1412110003), we get a palindrome (4412222144).
The spelling of 3000112141 in words is "three billion, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •