Base | Representation |
---|---|
bin | 1011000111111001011111… |
… | …1100100100111011101001 |
3 | 1121022012121002220211220122 |
4 | 2301332113330210323221 |
5 | 3100340144202144431 |
6 | 42002310523133025 |
7 | 2401416521225033 |
oct | 261762774447351 |
9 | 47265532824818 |
10 | 12230321131241 |
11 | 3995939486754 |
12 | 1456399974175 |
13 | 6a941178cc25 |
14 | 303d44a1cc53 |
15 | 1632132a3a7b |
hex | b1f97f24ee9 |
12230321131241 has 2 divisors, whose sum is σ = 12230321131242. Its totient is φ = 12230321131240.
The previous prime is 12230321131181. The next prime is 12230321131247. The reversal of 12230321131241 is 14213112303221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6294378499600 + 5935942631641 = 2508860^2 + 2436379^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230321131241 - 26 = 12230321131177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12230321131241.
It is not a weakly prime, because it can be changed into another prime (12230321131247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115160565620 + 6115160565621.
It is an arithmetic number, because the mean of its divisors is an integer number (6115160565621).
Almost surely, 212230321131241 is an apocalyptic number.
It is an amenable number.
12230321131241 is a deficient number, since it is larger than the sum of its proper divisors (1).
12230321131241 is an equidigital number, since it uses as much as digits as its factorization.
12230321131241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 12230321131241 its reverse (14213112303221), we get a palindrome (26443433434462).
The spelling of 12230321131241 in words is "twelve trillion, two hundred thirty billion, three hundred twenty-one million, one hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •