Base | Representation |
---|---|
bin | 101101100010111100001000… |
… | …100011110001000101100011 |
3 | 222021020202011222101102000001 |
4 | 231202330020203301011203 |
5 | 202223412234031440341 |
6 | 1550010324540440431 |
7 | 60123100634462005 |
oct | 5542741043610543 |
9 | 867222158342001 |
10 | 200313123311971 |
11 | 5890a355a5911a |
12 | 1a572037849117 |
13 | 87a05a5ba5a37 |
14 | 37672c7a30375 |
15 | 182590d90bd31 |
hex | b62f088f1163 |
200313123311971 has 2 divisors, whose sum is σ = 200313123311972. Its totient is φ = 200313123311970.
The previous prime is 200313123311933. The next prime is 200313123312047. The reversal of 200313123311971 is 179113321313002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200313123311971 - 219 = 200313122787683 is a prime.
It is a super-3 number, since 3×2003131233119713 (a number of 44 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200313123311971.
It is not a weakly prime, because it can be changed into another prime (200313123311071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100156561655985 + 100156561655986.
It is an arithmetic number, because the mean of its divisors is an integer number (100156561655986).
Almost surely, 2200313123311971 is an apocalyptic number.
200313123311971 is a deficient number, since it is larger than the sum of its proper divisors (1).
200313123311971 is an equidigital number, since it uses as much as digits as its factorization.
200313123311971 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412, while the sum is 37.
Adding to 200313123311971 its reverse (179113321313002), we get a palindrome (379426444624973).
The spelling of 200313123311971 in words is "two hundred trillion, three hundred thirteen billion, one hundred twenty-three million, three hundred eleven thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •