Properties of the Number -1152271

One Hundred Fifty-Two Thousand Two Hundred Seventy-One

Basics

Value: -1152272 → -1152271 → -1152270

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 43 × 127 × 211

Divisors: 1, 43, 127, 211, 5461, 9073, 26797, 1152271

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

375 Try Today's Challenge

Representations

Binary: -100011001010100001111

Octal: -4312417

Duodecimal: -4769A7

Hexadecimal: -11950f

Square: 1327728457441

Square Root: 1073.4388664474563

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Primary Carmichael numbers. A324316

Least pseudoprime to base 2 through base prime(n). A83876

a(n) is the smallest Carmichael number (A002997) with the n-th prime as its smallest prime divisor, or 0 if no such number exists. A135720

Odd numbers with increasing numbers of bases to which they are strong pseudoprimes. A141768

Composite numbers n such that gcd(φ(n), n-1) = λ(n), where λ(n) = A002322(n). A264012

Carmichael numbers ending in 1. A354609

Pseudoprimes to bases 2, 3, 5 and 7. A83739

a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists. A135721

Carmichael numbers congruent to 3 modulo 4. A185321