Base | Representation |
---|---|
bin | 1011000110110110011000… |
… | …0000000000011011010111 |
3 | 1121020111002102012012110011 |
4 | 2301231212000000123113 |
5 | 3100041244121102221 |
6 | 41550131002341051 |
7 | 2400211155206512 |
oct | 261554600003327 |
9 | 47214072165404 |
10 | 12212303300311 |
11 | 3989232925694 |
12 | 14529ab7ba787 |
13 | 6a77cc9585ca |
14 | 303115aadd79 |
15 | 162a0b5771e1 |
hex | b1b660006d7 |
12212303300311 has 8 divisors (see below), whose sum is σ = 12443029643520. Its totient is φ = 11981588272992.
The previous prime is 12212303300293. The next prime is 12212303300359. The reversal of 12212303300311 is 11300330321221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12212303300311 - 211 = 12212303298263 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 (12212303300611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 634216 + ... + 4982653.
It is an arithmetic number, because the mean of its divisors is an integer number (1555378705440).
Almost surely, 212212303300311 is an apocalyptic number.
12212303300311 is a deficient number, since it is larger than the sum of its proper divisors (230726343209).
12212303300311 is an equidigital number, since it uses as much as digits as its factorization.
12212303300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5657945.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12212303300311 its reverse (11300330321221), we get a palindrome (23512633621532).
The spelling of 12212303300311 in words is "twelve trillion, two hundred twelve billion, three hundred three million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •