Base | Representation |
---|---|
bin | 1011001011110000… |
… | …1001110001010111 |
3 | 21202020000010222111 |
4 | 2302330021301113 |
5 | 22122020104421 |
6 | 1213521411451 |
7 | 134252353234 |
oct | 26274116127 |
9 | 7666003874 |
10 | 3002113111 |
11 | 1300684018 |
12 | 6b9499b87 |
13 | 38ac742ba |
14 | 2069d678b |
15 | 12885eee1 |
hex | b2f09c57 |
3002113111 has 8 divisors (see below), whose sum is σ = 3209046624. Its totient is φ = 2801546880.
The previous prime is 3002113099. The next prime is 3002113133. The reversal of 3002113111 is 1113112003.
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 3002113111 - 219 = 3001588823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3002113091 and 3002113100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002113151) 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, 1590846 + ... + 1592731.
It is an arithmetic number, because the mean of its divisors is an integer number (401130828).
Almost surely, 23002113111 is an apocalyptic number.
3002113111 is a deficient number, since it is larger than the sum of its proper divisors (206933513).
3002113111 is a wasteful number, since it uses less digits than its factorization.
3002113111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3183641.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 3002113111 is about 54791.5423309109. The cubic root of 3002113111 is about 1442.5881167693.
Adding to 3002113111 its reverse (1113112003), we get a palindrome (4115225114).
The spelling of 3002113111 in words is "three billion, two million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •