Base | Representation |
---|---|
bin | 110000100110111011010… |
… | …111010000001111011101 |
3 | 102211022222112220020001010 |
4 | 300212323113100033131 |
5 | 414212000223233341 |
6 | 11034310001205433 |
7 | 463221365142354 |
oct | 60467327201735 |
9 | 12738875806033 |
10 | 3340333024221 |
11 | 1078699a01046 |
12 | 45b466930879 |
13 | 1b2cb87024cb |
14 | b795c93499b |
15 | 5bd52c6d716 |
hex | 309bb5d03dd |
3340333024221 has 32 divisors (see below), whose sum is σ = 4501808513280. Its totient is φ = 2203014285824.
The previous prime is 3340333024201. The next prime is 3340333024277. The reversal of 3340333024221 is 1224203330433.
It is a cyclic number.
It is not a de Polignac number, because 3340333024221 - 210 = 3340333023197 is a prime.
It is a super-2 number, since 2×33403330242212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3340333024201) 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 31 ways as a sum of consecutive naturals, for example, 194321095 + ... + 194338283.
It is an arithmetic number, because the mean of its divisors is an integer number (140681516040).
Almost surely, 23340333024221 is an apocalyptic number.
It is an amenable number.
3340333024221 is a deficient number, since it is larger than the sum of its proper divisors (1161475489059).
3340333024221 is a wasteful number, since it uses less digits than its factorization.
3340333024221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19205.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 3340333024221 its reverse (1224203330433), we get a palindrome (4564536354654).
The spelling of 3340333024221 in words is "three trillion, three hundred forty billion, three hundred thirty-three million, twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •