Base | Representation |
---|---|
bin | 1011001011100001… |
… | …1000010111110101 |
3 | 21202011010220122101 |
4 | 2302320120113311 |
5 | 22121241434331 |
6 | 1213444302101 |
7 | 134241064435 |
oct | 26270302765 |
9 | 7664126571 |
10 | 3001124341 |
11 | 1300069156 |
12 | 6b90a1931 |
13 | 38a9b9227 |
14 | 20681a2c5 |
15 | 128717061 |
hex | b2e185f5 |
3001124341 has 4 divisors (see below), whose sum is σ = 3131608032. Its totient is φ = 2870640652.
The previous prime is 3001124333. The next prime is 3001124369. The reversal of 3001124341 is 1434211003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3001124341 - 23 = 3001124333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3001124741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65241811 + ... + 65241856.
It is an arithmetic number, because the mean of its divisors is an integer number (782902008).
Almost surely, 23001124341 is an apocalyptic number.
It is an amenable number.
3001124341 is a deficient number, since it is larger than the sum of its proper divisors (130483691).
3001124341 is a wasteful number, since it uses less digits than its factorization.
3001124341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130483690.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 3001124341 is about 54782.5185711647. The cubic root of 3001124341 is about 1442.4297233949.
Adding to 3001124341 its reverse (1434211003), we get a palindrome (4435335344).
The spelling of 3001124341 in words is "three billion, one million, one hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •