Properties of the Number -15723

Fifteen Thousand Seven Hundred Twenty-Three

Basics

Value: -15724 → -15723 → -15722

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1747

Divisors: 1, 3, 9, 1747, 5241, 15723

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110101101011

Octal: -36553

Duodecimal: -9123

Hexadecimal: -3d6b

Square: 247212729

Square Root: 125.3913872640382

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

Number of partitions of n in which no parts are multiples of 3. A726

Perfect totient numbers. A82897

Starts of runs of 3 consecutive tribonacci-Niven numbers (A352089). A352091

List of codewords in binary lexicode with Hamming distance 6 written as decimal numbers. A75934

Perfect totient numbers, omitting powers of 3. A91847

Difference between 10ⁿ and the first prime of gap 4 > 10ⁿ. A227432

Starts of runs of 3 consecutive integers whose exponent of least prime factor in their prime factorization is even. A365871

Where record values occur in A276781, when starting from A276781(2)=1. A276782

a(n) is the smallest integer k > n such that (k+1)(k+2)...(2k-2n+1)/(k(k-1)...(k-n+1)) is an integer. A290791

Positive integers n such that S(n) divides n, where S(n) is the sum of the iterates of the Euler φ-function of n, that is, S(n) = φ(n)+φ(φ(n))+....+ 1. A113808