Base | Representation |
---|---|
bin | 1011001011110000… |
… | …1001010101001111 |
3 | 21202020000001111211 |
4 | 2302330021111033 |
5 | 22122020030221 |
6 | 1213521355251 |
7 | 134252345053 |
oct | 26274112517 |
9 | 7666001454 |
10 | 3002111311 |
11 | 1300682731 |
12 | 6b9498b27 |
13 | 38ac73534 |
14 | 2069d5c63 |
15 | 12885e6e1 |
hex | b2f0954f |
3002111311 has 8 divisors (see below), whose sum is σ = 3218944320. Its totient is φ = 2789749248.
The previous prime is 3002111309. The next prime is 3002111347. The reversal of 3002111311 is 1131112003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3002111311 - 21 = 3002111309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3002111291 and 3002111300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002111351) 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 7 ways as a sum of consecutive naturals, for example, 1116346 + ... + 1119031.
It is an arithmetic number, because the mean of its divisors is an integer number (402368040).
Almost surely, 23002111311 is an apocalyptic number.
3002111311 is a deficient number, since it is larger than the sum of its proper divisors (216833009).
3002111311 is a wasteful number, since it uses less digits than its factorization.
3002111311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2235473.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 3002111311 is about 54791.5259050156. The cubic root of 3002111311 is about 1442.5878284547.
Adding to 3002111311 its reverse (1131112003), we get a palindrome (4133223314).
The spelling of 3002111311 in words is "three billion, two million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •