Base | Representation |
---|---|
bin | 1011001000000100010011… |
… | …1010011010001010100101 |
3 | 1121022111002100100010121022 |
4 | 2302001010322122022211 |
5 | 3100412120043134341 |
6 | 42003510504500525 |
7 | 2401551445666466 |
oct | 262010472321245 |
9 | 47274070303538 |
10 | 12233223021221 |
11 | 3997098526634 |
12 | 1456a6977a745 |
13 | 6a9784a42ca7 |
14 | 30413c1a6d6d |
15 | 163332e17e4b |
hex | b2044e9a2a5 |
12233223021221 has 2 divisors, whose sum is σ = 12233223021222. Its totient is φ = 12233223021220.
The previous prime is 12233223021203. The next prime is 12233223021287. The reversal of 12233223021221 is 12212032233221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11568916518721 + 664306502500 = 3401311^2 + 815050^2 .
It is an emirp because it is prime and its reverse (12212032233221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12233223021221 - 226 = 12233155912357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12233223021521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116611510610 + 6116611510611.
It is an arithmetic number, because the mean of its divisors is an integer number (6116611510611).
Almost surely, 212233223021221 is an apocalyptic number.
It is an amenable number.
12233223021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12233223021221 is an equidigital number, since it uses as much as digits as its factorization.
12233223021221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 12233223021221 its reverse (12212032233221), we get a palindrome (24445255254442).
The spelling of 12233223021221 in words is "twelve trillion, two hundred thirty-three billion, two hundred twenty-three million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •