Base | Representation |
---|---|
bin | 101011101011001101010… |
… | …010000000001000010011 |
3 | 101121220221221012022101000 |
4 | 223223031102000020103 |
5 | 343133211243033021 |
6 | 10214443104113043 |
7 | 426560533306644 |
oct | 53531522001023 |
9 | 11556857168330 |
10 | 3001331221011 |
11 | a57948258832 |
12 | 405817905783 |
13 | 18a041579846 |
14 | a539da236cb |
15 | 5311154eb26 |
hex | 2bacd480213 |
3001331221011 has 32 divisors (see below), whose sum is σ = 4481868948480. Its totient is φ = 1984992494688.
The previous prime is 3001331220989. The next prime is 3001331221019. The reversal of 3001331221011 is 1101221331003.
3001331221011 is a `hidden beast` number, since 300 + 1 + 331 + 2 + 21 + 0 + 11 = 666.
It is not a de Polignac number, because 3001331221011 - 29 = 3001331220499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3001331221019) 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 31 ways as a sum of consecutive naturals, for example, 1032630 + ... + 2658756.
It is an arithmetic number, because the mean of its divisors is an integer number (140058404640).
Almost surely, 23001331221011 is an apocalyptic number.
3001331221011 is a deficient number, since it is larger than the sum of its proper divisors (1480537727469).
3001331221011 is a wasteful number, since it uses less digits than its factorization.
3001331221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626680 (or 1626674 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 3001331221011 its reverse (1101221331003), we get a palindrome (4102552552014).
The spelling of 3001331221011 in words is "three trillion, one billion, three hundred thirty-one million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •