Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …1000110010000010010101 |
3 | 1121020120200201200022202112 |
4 | 2301232202020302002111 |
5 | 3100100330412433441 |
6 | 41550415043320405 |
7 | 2400245156045162 |
oct | 261564210620225 |
9 | 47216621608675 |
10 | 12213312233621 |
11 | 39897003a0174 |
12 | 1453031680105 |
13 | 6a79309a2975 |
14 | 3031adaa5069 |
15 | 162a69e204eb |
hex | b1ba2232095 |
12213312233621 has 2 divisors, whose sum is σ = 12213312233622. Its totient is φ = 12213312233620.
The previous prime is 12213312233581. The next prime is 12213312233657. The reversal of 12213312233621 is 12633221331221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8507494731121 + 3705817502500 = 2916761^2 + 1925050^2 .
It is an emirp because it is prime and its reverse (12633221331221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12213312233621 - 218 = 12213311971477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213312233321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106656116810 + 6106656116811.
It is an arithmetic number, because the mean of its divisors is an integer number (6106656116811).
Almost surely, 212213312233621 is an apocalyptic number.
It is an amenable number.
12213312233621 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213312233621 is an equidigital number, since it uses as much as digits as its factorization.
12213312233621 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15552, while the sum is 32.
Adding to 12213312233621 its reverse (12633221331221), we get a palindrome (24846533564842).
The spelling of 12213312233621 in words is "twelve trillion, two hundred thirteen billion, three hundred twelve million, two hundred thirty-three thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •