Base | Representation |
---|---|
bin | 1100000010000110011010… |
… | …1011110100000000101101 |
3 | 1201211210111220212120002021 |
4 | 3000201212223310000231 |
5 | 3213230443320023231 |
6 | 44045514033430141 |
7 | 2533565143525534 |
oct | 300414653640055 |
9 | 51753456776067 |
10 | 13230222032941 |
11 | 42409a6476621 |
12 | 159813270b351 |
13 | 74c7b236c504 |
14 | 33a4bbc2b31b |
15 | 17e235e92811 |
hex | c0866af402d |
13230222032941 has 2 divisors, whose sum is σ = 13230222032942. Its totient is φ = 13230222032940.
The previous prime is 13230222032921. The next prime is 13230222032971. The reversal of 13230222032941 is 14923022203231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11798167043716 + 1432054989225 = 3434846^2 + 1196685^2 .
It is an emirp because it is prime and its reverse (14923022203231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13230222032941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13230222032897 and 13230222032906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13230222032921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6615111016470 + 6615111016471.
It is an arithmetic number, because the mean of its divisors is an integer number (6615111016471).
Almost surely, 213230222032941 is an apocalyptic number.
It is an amenable number.
13230222032941 is a deficient number, since it is larger than the sum of its proper divisors (1).
13230222032941 is an equidigital number, since it uses as much as digits as its factorization.
13230222032941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 13230222032941 in words is "thirteen trillion, two hundred thirty billion, two hundred twenty-two million, thirty-two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •