Properties of the Number -62491

Sixty-Two Thousand Four Hundred Ninety-One

Basics

Value: -62492 → -62491 → -62490

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 13 × 19 × 23

Divisors: 1, 11, 13, 19, 23, 143, 209, 247, 253, 299

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111010000011011

Octal: -172033

Duodecimal: -301B7

Hexadecimal: -f41b

Square: 3905125081

Square Root: 249.98199935195333

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

a(n) is the number of binary strings of length n such that no subsequence of length 4 contains 3 or more ones. A118647

Composite squarefree numbers n such that p-d(n) divides n-d(n), where p are the prime factors of n and d(n) the number of divisors of n. A228300

Composite squarefree numbers n such that p(i)-5 divides n+5, where p(i) are the prime factors of n. A225705

Quasi-Carmichael numbers to base -5: squarefree composites n such that prime p∣n ==> p+5∣n+5. A29565

Numbers k such that 2^k + 3·k is prime. A93988

a(n) is the smallest positive integer such that 10^{2 + floor(k/a(1}) + floor(k/a(2)) + ... + floor(k/a(n))) divides (k+9)! for all k > 0. A218976

4-brilliant numbers with distinct prime factors. A376864

Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTN = ZSM-39 [Si136O272].qR starting with a T3 atom. A19183