Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …0001000100010011100111 |
3 | 1121020120200120212120122212 |
4 | 2301232202001010103213 |
5 | 3100100324403230203 |
6 | 41550414532114035 |
7 | 2400245132623205 |
oct | 261564201042347 |
9 | 47216616776585 |
10 | 12213310211303 |
11 | 39896aa239833 |
12 | 1453030a6591b |
13 | 6a7930445326 |
14 | 3031ad6da075 |
15 | 162a69b711d8 |
hex | b1ba20444e7 |
12213310211303 has 8 divisors (see below), whose sum is σ = 12403508931072. Its totient is φ = 12023344153656.
The previous prime is 12213310211279. The next prime is 12213310211339. The reversal of 12213310211303 is 30311201331221.
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 12213310211303 - 26 = 12213310211239 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 (12213310231303) 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, 58059725 + ... + 58269702.
It is an arithmetic number, because the mean of its divisors is an integer number (1550438616384).
Almost surely, 212213310211303 is an apocalyptic number.
12213310211303 is a deficient number, since it is larger than the sum of its proper divisors (190198719769).
12213310211303 is a wasteful number, since it uses less digits than its factorization.
12213310211303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116331061.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12213310211303 its reverse (30311201331221), we get a palindrome (42524511542524).
The spelling of 12213310211303 in words is "twelve trillion, two hundred thirteen billion, three hundred ten million, two hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •