Base | Representation |
---|---|
bin | 1011001011100010… |
… | …1111111111110111 |
3 | 21202011022211101110 |
4 | 2302320233333313 |
5 | 22121303033421 |
6 | 1213450330103 |
7 | 134241646530 |
oct | 26270577767 |
9 | 7664284343 |
10 | 3001221111 |
11 | 1300124929 |
12 | 6b9129933 |
13 | 38aa212a5 |
14 | 206843687 |
15 | 128735a76 |
hex | b2e2fff7 |
3001221111 has 8 divisors (see below), whose sum is σ = 4573289344. Its totient is φ = 1714983480.
The previous prime is 3001221061. The next prime is 3001221169. The reversal of 3001221111 is 1111221003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3001221111 - 211 = 3001219063 is a prime.
It is a super-2 number, since 2×30012211112 = 18014656314224148642, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3001221211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71457625 + ... + 71457666.
It is an arithmetic number, because the mean of its divisors is an integer number (571661168).
Almost surely, 23001221111 is an apocalyptic number.
3001221111 is a deficient number, since it is larger than the sum of its proper divisors (1572068233).
3001221111 is a wasteful number, since it uses less digits than its factorization.
3001221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142915301.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 3001221111 is about 54783.4017837520. The cubic root of 3001221111 is about 1442.4452267428.
Adding to 3001221111 its reverse (1111221003), we get a palindrome (4112442114).
The spelling of 3001221111 in words is "three billion, one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •