Base | Representation |
---|---|
bin | 1011000110111000111110… |
… | …1101111111111111101101 |
3 | 1121020112220012012221220111 |
4 | 2301232033231333333231 |
5 | 3100044212311114041 |
6 | 41550324244220021 |
7 | 2400234414356506 |
oct | 261561755777755 |
9 | 47215805187814 |
10 | 12213003223021 |
11 | 3989561a21a07 |
12 | 1452b6609a611 |
13 | 6a78b196b763 |
14 | 303180a27bad |
15 | 162a4cc31981 |
hex | b1b8fb7ffed |
12213003223021 has 2 divisors, whose sum is σ = 12213003223022. Its totient is φ = 12213003223020.
The previous prime is 12213003222989. The next prime is 12213003223027. The reversal of 12213003223021 is 12032230031221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11909325078121 + 303678144900 = 3450989^2 + 551070^2 .
It is a cyclic number.
It is not a de Polignac number, because 12213003223021 - 25 = 12213003222989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12213003222983 and 12213003223001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213003223027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106501611510 + 6106501611511.
It is an arithmetic number, because the mean of its divisors is an integer number (6106501611511).
Almost surely, 212213003223021 is an apocalyptic number.
It is an amenable number.
12213003223021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213003223021 is an equidigital number, since it uses as much as digits as its factorization.
12213003223021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12213003223021 its reverse (12032230031221), we get a palindrome (24245233254242).
The spelling of 12213003223021 in words is "twelve trillion, two hundred thirteen billion, three million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •