Base | Representation |
---|---|
bin | 1011000110111010001010… |
… | …0111101010110001000111 |
3 | 1121020120201021220200022221 |
4 | 2301232202213222301013 |
5 | 3100100340001032221 |
6 | 41550415533033211 |
7 | 2400245314626532 |
oct | 261564247526107 |
9 | 47216637820287 |
10 | 12213320330311 |
11 | 3989704a20351 |
12 | 1453034325807 |
13 | 6a79325790c9 |
14 | 3031b0bb1a19 |
15 | 162a6a9be541 |
hex | b1ba29eac47 |
12213320330311 has 8 divisors (see below), whose sum is σ = 12338743692704. Its totient is φ = 12088028649600.
The previous prime is 12213320330257. The next prime is 12213320330333. The reversal of 12213320330311 is 11303302331221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12213320330311 - 29 = 12213320329799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12213320330011) 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, 32733966 + ... + 33104971.
It is an arithmetic number, because the mean of its divisors is an integer number (1542342961588).
Almost surely, 212213320330311 is an apocalyptic number.
12213320330311 is a deficient number, since it is larger than the sum of its proper divisors (125423362393).
12213320330311 is a wasteful number, since it uses less digits than its factorization.
12213320330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65840841.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12213320330311 its reverse (11303302331221), we get a palindrome (23516622661532).
The spelling of 12213320330311 in words is "twelve trillion, two hundred thirteen billion, three hundred twenty million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •