Base | Representation |
---|---|
bin | 101101100110011100110000… |
… | …011011001100000110010011 |
3 | 222022002210201201021220121221 |
4 | 231212130300123030012103 |
5 | 202241340211420224111 |
6 | 1550313213411225511 |
7 | 60146366525306116 |
oct | 5546346033140623 |
9 | 868083651256557 |
10 | 200554310320531 |
11 | 589a2672810472 |
12 | 1a5b09288a8297 |
13 | 87ba26217059b |
14 | 3774c47bca57d |
15 | 182bd27b89371 |
hex | b667306cc193 |
200554310320531 has 2 divisors, whose sum is σ = 200554310320532. Its totient is φ = 200554310320530.
The previous prime is 200554310320501. The next prime is 200554310320541. The reversal of 200554310320531 is 135023013455002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200554310320531 - 29 = 200554310320019 is a prime.
It is a super-2 number, since 2×2005543103205312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200554310320501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100277155160265 + 100277155160266.
It is an arithmetic number, because the mean of its divisors is an integer number (100277155160266).
Almost surely, 2200554310320531 is an apocalyptic number.
200554310320531 is a deficient number, since it is larger than the sum of its proper divisors (1).
200554310320531 is an equidigital number, since it uses as much as digits as its factorization.
200554310320531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 200554310320531 its reverse (135023013455002), we get a palindrome (335577323775533).
The spelling of 200554310320531 in words is "two hundred trillion, five hundred fifty-four billion, three hundred ten million, three hundred twenty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •