Properties of the Number 15493

Fifteen Thousand Four Hundred Ninety-Three

Basics

Value: 15492 → 15493 → 15494

Parity: odd

Prime: Yes

Previous Prime: 15473

Next Prime: 15497

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 15493

Divisors: 1, 15493

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11110010000101

Octal: 36205

Duodecimal: 8B71

Hexadecimal: 3c85

Square: 240033049

Square Root: 124.47088012864695

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 the sequence of frequencies of the summands is nondecreasing. A100883

T(n,k) = Number of length n+5 0..k arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four. A249085

Primes that are the first in a run of exactly 5 emirps. A346025

Number of partitions of n such that (greatest part) + (least part) < number of parts. A237822

Number of partitions p of n such that the multiplicity of (min(p) + max(p))/2 is a part. A240497

The smallest position with nim-value n in subtract-a-square game. A297963

Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1-x)^2·n+3*( ∑_{j >= 0} (2·j+ 1)ⁿ*x^j )*( ∑_{j >= 0} jⁿ⁺¹*x^j ), read by rows. A165883

3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10·last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]). A166513

Odd terms of A059756. A111042

Primes that remain prime through 3 iterations of function f(x) = 8x + 9. A23295