Base | Representation |
---|---|
bin | 1011000110111001110000… |
… | …0111011101010100000111 |
3 | 1121020120102200121110122122 |
4 | 2301232130013131110013 |
5 | 3100100124033121203 |
6 | 41550401034320155 |
7 | 2400242521344356 |
oct | 261563407352407 |
9 | 47216380543578 |
10 | 12213211223303 |
11 | 3989659379672 |
12 | 145300388905b |
13 | 6a7915a9734c |
14 | 3031a04cd99d |
15 | 162a6111b538 |
hex | b1b9c1dd507 |
12213211223303 has 8 divisors (see below), whose sum is σ = 12548539766448. Its totient is φ = 11878158561984.
The previous prime is 12213211223273. The next prime is 12213211223327. The reversal of 12213211223303 is 30332211231221.
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 12213211223303 - 212 = 12213211219207 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 (12213211223393) 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, 68880701 + ... + 69057782.
It is an arithmetic number, because the mean of its divisors is an integer number (1568567470806).
Almost surely, 212213211223303 is an apocalyptic number.
12213211223303 is a deficient number, since it is larger than the sum of its proper divisors (335328543145).
12213211223303 is a wasteful number, since it uses less digits than its factorization.
12213211223303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137940913.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 12213211223303 its reverse (30332211231221), we get a palindrome (42545422454524).
The spelling of 12213211223303 in words is "twelve trillion, two hundred thirteen billion, two hundred eleven million, two hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •