Base | Representation |
---|---|
bin | 101101100001100110010101… |
… | …111111101111111110011001 |
3 | 222020220221102020012121001201 |
4 | 231201212111333233332121 |
5 | 202220410110240020033 |
6 | 1545500132155314201 |
7 | 60113330126402515 |
oct | 5541462577577631 |
9 | 866827366177051 |
10 | 200221006954393 |
11 | 58884285747287 |
12 | 1a55820a14b961 |
13 | 87949b5789389 |
14 | 3762a69a29145 |
15 | 182331b88647d |
hex | b61995feff99 |
200221006954393 has 2 divisors, whose sum is σ = 200221006954394. Its totient is φ = 200221006954392.
The previous prime is 200221006954391. The next prime is 200221006954433. The reversal of 200221006954393 is 393459600122002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152935071022864 + 47285935931529 = 12366692^2 + 6876477^2 .
It is a cyclic number.
It is not a de Polignac number, because 200221006954393 - 21 = 200221006954391 is a prime.
Together with 200221006954391, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (200221006954391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110503477196 + 100110503477197.
It is an arithmetic number, because the mean of its divisors is an integer number (100110503477197).
Almost surely, 2200221006954393 is an apocalyptic number.
It is an amenable number.
200221006954393 is a deficient number, since it is larger than the sum of its proper divisors (1).
200221006954393 is an equidigital number, since it uses as much as digits as its factorization.
200221006954393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 46.
The spelling of 200221006954393 in words is "two hundred trillion, two hundred twenty-one billion, six million, nine hundred fifty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •