Base | Representation |
---|---|
bin | 110010010011100111001011… |
… | …100011010101101001010001 |
3 | 1002000101022002110121100022122 |
4 | 302103213023203111221101 |
5 | 212444430113212414033 |
6 | 2102320513222344025 |
7 | 64413534605504522 |
oct | 6223471343255121 |
9 | 1060338073540278 |
10 | 221250065357393 |
11 | 64551697a0a4a6 |
12 | 209938b328b015 |
13 | 965ba3a301937 |
14 | 3c8c7bb670849 |
15 | 1a8a34e0b5a98 |
hex | c939cb8d5a51 |
221250065357393 has 2 divisors, whose sum is σ = 221250065357394. Its totient is φ = 221250065357392.
The previous prime is 221250065357353. The next prime is 221250065357401. The reversal of 221250065357393 is 393753560052122.
221250065357393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117041738127889 + 104208327229504 = 10818583^2 + 10208248^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221250065357393 is a prime.
It is not a weakly prime, because it can be changed into another prime (221250065357303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110625032678696 + 110625032678697.
It is an arithmetic number, because the mean of its divisors is an integer number (110625032678697).
Almost surely, 2221250065357393 is an apocalyptic number.
It is an amenable number.
221250065357393 is a deficient number, since it is larger than the sum of its proper divisors (1).
221250065357393 is an equidigital number, since it uses as much as digits as its factorization.
221250065357393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10206000, while the sum is 53.
The spelling of 221250065357393 in words is "two hundred twenty-one trillion, two hundred fifty billion, sixty-five million, three hundred fifty-seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •