Base | Representation |
---|---|
bin | 101101101111000001001001… |
… | …000100110011101010110011 |
3 | 222101012002120212200112201221 |
4 | 231233001021010303222303 |
5 | 202331012114401401001 |
6 | 1551443514051005511 |
7 | 60240053244365665 |
oct | 5557011104635263 |
9 | 871162525615657 |
10 | 201143134403251 |
11 | 590aa362641997 |
12 | 1a686a78899897 |
13 | 88309405cb991 |
14 | 3795545a8a535 |
15 | 183c2db7b91a1 |
hex | b6f049133ab3 |
201143134403251 has 2 divisors, whose sum is σ = 201143134403252. Its totient is φ = 201143134403250.
The previous prime is 201143134403249. The next prime is 201143134403417. The reversal of 201143134403251 is 152304431341102.
201143134403251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201143134403251 - 21 = 201143134403249 is a prime.
Together with 201143134403249, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201143134433251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100571567201625 + 100571567201626.
It is an arithmetic number, because the mean of its divisors is an integer number (100571567201626).
Almost surely, 2201143134403251 is an apocalyptic number.
201143134403251 is a deficient number, since it is larger than the sum of its proper divisors (1).
201143134403251 is an equidigital number, since it uses as much as digits as its factorization.
201143134403251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 201143134403251 its reverse (152304431341102), we get a palindrome (353447565744353).
The spelling of 201143134403251 in words is "two hundred one trillion, one hundred forty-three billion, one hundred thirty-four million, four hundred three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •