Base | Representation |
---|---|
bin | 101101100011000101011100… |
… | …000100100001010000110111 |
3 | 222021021200222021021021212012 |
4 | 231203011130010201100313 |
5 | 202224043214232411211 |
6 | 1550015100203114435 |
7 | 60123603343022534 |
oct | 5543053404412067 |
9 | 867250867237765 |
10 | 200323114341431 |
11 | 589136126a6464 |
12 | 1a573b65812a1b |
13 | 87a1508a720a3 |
14 | 37679948d9d8b |
15 | 1825ce5ae6d8b |
hex | b6315c121437 |
200323114341431 has 2 divisors, whose sum is σ = 200323114341432. Its totient is φ = 200323114341430.
The previous prime is 200323114341373. The next prime is 200323114341433. The reversal of 200323114341431 is 134143411323002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200323114341431 - 26 = 200323114341367 is a prime.
It is a super-2 number, since 2×2003231143414312 (a number of 29 digits) contains 22 as substring.
Together with 200323114341433, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200323114341433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100161557170715 + 100161557170716.
It is an arithmetic number, because the mean of its divisors is an integer number (100161557170716).
Almost surely, 2200323114341431 is an apocalyptic number.
200323114341431 is a deficient number, since it is larger than the sum of its proper divisors (1).
200323114341431 is an equidigital number, since it uses as much as digits as its factorization.
200323114341431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 200323114341431 its reverse (134143411323002), we get a palindrome (334466525664433).
The spelling of 200323114341431 in words is "two hundred trillion, three hundred twenty-three billion, one hundred fourteen million, three hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •