Base | Representation |
---|---|
bin | 1011001000000100010101… |
… | …1100101111101100110001 |
3 | 1121022111002222021102210101 |
4 | 2302001011130233230301 |
5 | 3100412124344203241 |
6 | 42003511425432401 |
7 | 2401551615335662 |
oct | 262010534575461 |
9 | 47274088242711 |
10 | 12233232022321 |
11 | 39970a2614262 |
12 | 1456a7079b701 |
13 | 6a9786874c9b |
14 | 30413d46b369 |
15 | 163333ae4e31 |
hex | b204572fb31 |
12233232022321 has 2 divisors, whose sum is σ = 12233232022322. Its totient is φ = 12233232022320.
The previous prime is 12233232022313. The next prime is 12233232022331. The reversal of 12233232022321 is 12322023233221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11193976147600 + 1039255874721 = 3345740^2 + 1019439^2 .
It is a cyclic number.
It is not a de Polignac number, because 12233232022321 - 23 = 12233232022313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12233232022321.
It is not a weakly prime, because it can be changed into another prime (12233232022331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116616011160 + 6116616011161.
It is an arithmetic number, because the mean of its divisors is an integer number (6116616011161).
Almost surely, 212233232022321 is an apocalyptic number.
It is an amenable number.
12233232022321 is a deficient number, since it is larger than the sum of its proper divisors (1).
12233232022321 is an equidigital number, since it uses as much as digits as its factorization.
12233232022321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 12233232022321 its reverse (12322023233221), we get a palindrome (24555255255542).
The spelling of 12233232022321 in words is "twelve trillion, two hundred thirty-three billion, two hundred thirty-two million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •