Properties of the Number -15453

Fifteen Thousand Four Hundred Fifty-Three

Basics

Value: -15454 → -15453 → -15452

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 101

Divisors: 1, 3, 9, 17, 51, 101, 153, 303, 909, 1717

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110001011101

Octal: -36135

Duodecimal: -8B39

Hexadecimal: -3c5d

Square: 238795209

Square Root: 124.31009613060397

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

The sum of the numbers on straight lines of incrementing length n when drawn over numbers of the square spiral, where each line contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one line. If two or more lines exist with the same sum the one containing the smallest number is chosen. A340974

Numbers k such that k⁶ == 1 (mod 7⁴). A56092

Divisors of 10¹⁶ - 1. A111211

9 times pentagonal numbers: 9·n*(3·n-1)/2. A152996

Square row sums of the table A072233 (A008284). A238312

Limiting reverse row of the array A274196. A274201

Numbers k for which there exists some m such that k = ∑_{i=1..1+floor(log₁₀(k))} binomial(m, d_i), where d_i is the i-th digit of k. A55481

Positions of records for terms in the continued fraction of Catalan's constant. A99790

Smallest number m such that for 0 <= k < n, np(m+k) = np(m)+k, where np(t) is number of primes p with prime(t) < p < prime(t)^{1 + 1/t}. A246791

Numbers k for which 5·k-4, 5·k-2, 5·k+2, and 5·k+4 are primes. A178082