Base | Representation |
---|---|
bin | 101101101111001011010111… |
… | …100110001001001100010111 |
3 | 222101020010221011110002020201 |
4 | 231233023113212021030113 |
5 | 202331202112023111211 |
6 | 1551452531440441331 |
7 | 60240622333565365 |
oct | 5557132746111427 |
9 | 871203834402221 |
10 | 201154115441431 |
11 | 59103a880a9459 |
12 | 1a689022319247 |
13 | 88319a06175c9 |
14 | 3795ca8222635 |
15 | 183c7308600c1 |
hex | b6f2d7989317 |
201154115441431 has 2 divisors, whose sum is σ = 201154115441432. Its totient is φ = 201154115441430.
The previous prime is 201154115441429. The next prime is 201154115441453. The reversal of 201154115441431 is 134144511451102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201154115441431 - 21 = 201154115441429 is a prime.
It is a super-2 number, since 2×2011541154414312 (a number of 29 digits) contains 22 as substring.
Together with 201154115441429, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201154115441401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100577057720715 + 100577057720716.
It is an arithmetic number, because the mean of its divisors is an integer number (100577057720716).
Almost surely, 2201154115441431 is an apocalyptic number.
201154115441431 is a deficient number, since it is larger than the sum of its proper divisors (1).
201154115441431 is an equidigital number, since it uses as much as digits as its factorization.
201154115441431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 37.
Adding to 201154115441431 its reverse (134144511451102), we get a palindrome (335298626892533).
The spelling of 201154115441431 in words is "two hundred one trillion, one hundred fifty-four billion, one hundred fifteen million, four hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •