Base | Representation |
---|---|
bin | 1011000111011111000101… |
… | …0101111010011000010001 |
3 | 1121021112021222121101110112 |
4 | 2301313301111322120101 |
5 | 3100231134114312241 |
6 | 41555135205211105 |
7 | 2401046026210412 |
oct | 261676125723021 |
9 | 47245258541415 |
10 | 12223231010321 |
11 | 3992930278991 |
12 | 1454b3b400a95 |
13 | 6a88518c1cc6 |
14 | 303871123809 |
15 | 162e4aad71eb |
hex | b1df157a611 |
12223231010321 has 2 divisors, whose sum is σ = 12223231010322. Its totient is φ = 12223231010320.
The previous prime is 12223231010281. The next prime is 12223231010339. The reversal of 12223231010321 is 12301013232221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10773073159696 + 1450157850625 = 3282236^2 + 1204225^2 .
It is a cyclic number.
It is not a de Polignac number, because 12223231010321 - 26 = 12223231010257 is a prime.
It is not a weakly prime, because it can be changed into another prime (12223231010371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111615505160 + 6111615505161.
It is an arithmetic number, because the mean of its divisors is an integer number (6111615505161).
Almost surely, 212223231010321 is an apocalyptic number.
It is an amenable number.
12223231010321 is a deficient number, since it is larger than the sum of its proper divisors (1).
12223231010321 is an equidigital number, since it uses as much as digits as its factorization.
12223231010321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12223231010321 its reverse (12301013232221), we get a palindrome (24524244242542).
The spelling of 12223231010321 in words is "twelve trillion, two hundred twenty-three billion, two hundred thirty-one million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •