Base | Representation |
---|---|
bin | 110000000001011000000… |
… | …010110011011010011011 |
3 | 102200110220111210122012222 |
4 | 300001120002303122123 |
5 | 413031411033410321 |
6 | 11004000554054255 |
7 | 460263242202404 |
oct | 60013002633233 |
9 | 12613814718188 |
10 | 3300012013211 |
11 | 1062588828751 |
12 | 45369341a38b |
13 | 1ac260ca6804 |
14 | b5a158849ab |
15 | 5ac92ec73ab |
hex | 300580b369b |
3300012013211 has 8 divisors (see below), whose sum is σ = 3306598012080. Its totient is φ = 3293428774528.
The previous prime is 3300012013187. The next prime is 3300012013217. The reversal of 3300012013211 is 1123102100033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3300012013211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3300012013211.
It is not an unprimeable number, because it can be changed into a prime (3300012013217) 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, 1711820 + ... + 3087126.
It is an arithmetic number, because the mean of its divisors is an integer number (413324751510).
Almost surely, 23300012013211 is an apocalyptic number.
3300012013211 is a deficient number, since it is larger than the sum of its proper divisors (6585998869).
3300012013211 is a wasteful number, since it uses less digits than its factorization.
3300012013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1380093.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3300012013211 its reverse (1123102100033), we get a palindrome (4423114113244).
The spelling of 3300012013211 in words is "three trillion, three hundred billion, twelve million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •