Base | Representation |
---|---|
bin | 110000001100110100011… |
… | …101111000000010000101 |
3 | 102201122121212212200020220 |
4 | 300030310131320002011 |
5 | 413232042302012013 |
6 | 11013352153014553 |
7 | 461206611505431 |
oct | 60146435700205 |
9 | 12648555780226 |
10 | 3312300032133 |
11 | 1067814020194 |
12 | 455b426b4459 |
13 | 1b046ba02921 |
14 | b645d8379c1 |
15 | 5b261b8bb23 |
hex | 30334778085 |
3312300032133 has 8 divisors (see below), whose sum is σ = 4430785711968. Its totient is φ = 2201007186864.
The previous prime is 3312300032099. The next prime is 3312300032161.
3312300032133 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3312300032133 - 216 = 3312299966597 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3312300032233) 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, 1798207566 + ... + 1798209407.
It is an arithmetic number, because the mean of its divisors is an integer number (553848213996).
Almost surely, 23312300032133 is an apocalyptic number.
It is an amenable number.
3312300032133 is a deficient number, since it is larger than the sum of its proper divisors (1118485679835).
3312300032133 is a wasteful number, since it uses less digits than its factorization.
3312300032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3596417283.
The product of its (nonzero) digits is 2916, while the sum is 24.
It can be divided in two parts, 33123000 and 32133, that added together give a palindrome (33155133).
The spelling of 3312300032133 in words is "three trillion, three hundred twelve billion, three hundred million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •