Base | Representation |
---|---|
bin | 1011000111111100110110… |
… | …0010101101110010011001 |
3 | 1121022021220202220102222002 |
4 | 2301333031202231302121 |
5 | 3100344014400241213 |
6 | 42002540044010345 |
7 | 2401451020221551 |
oct | 261771542556231 |
9 | 47267822812862 |
10 | 12231220321433 |
11 | 3996260005643 |
12 | 14565aab309b5 |
13 | 6a9525b61b29 |
14 | 303dcc208161 |
15 | 1632671c0658 |
hex | b1fcd8adc99 |
12231220321433 has 2 divisors, whose sum is σ = 12231220321434. Its totient is φ = 12231220321432.
The previous prime is 12231220321291. The next prime is 12231220321451. The reversal of 12231220321433 is 33412302213221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11390712750169 + 840507571264 = 3375013^2 + 916792^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12231220321433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12231220321396 and 12231220321405.
It is not a weakly prime, because it can be changed into another prime (12231220320433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115610160716 + 6115610160717.
It is an arithmetic number, because the mean of its divisors is an integer number (6115610160717).
Almost surely, 212231220321433 is an apocalyptic number.
It is an amenable number.
12231220321433 is a deficient number, since it is larger than the sum of its proper divisors (1).
12231220321433 is an equidigital number, since it uses as much as digits as its factorization.
12231220321433 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 29.
Adding to 12231220321433 its reverse (33412302213221), we get a palindrome (45643522534654).
The spelling of 12231220321433 in words is "twelve trillion, two hundred thirty-one billion, two hundred twenty million, three hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.802 sec. • engine limits •