Properties of the Number 13569

Thirteen Thousand Five Hundred Sixty-Nine

Basics

Value: 13568 → 13569 → 13570

Parity: odd

Prime: No

Previous Prime: 13567

Next Prime: 13577

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 4523

Divisors: 1, 3, 4523, 13569

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11010100000001

Octal: 32401

Duodecimal: 7A29

Hexadecimal: 3501

Square: 184117761

Square Root: 116.48605066702193

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

T(n,k)=1/4 the number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero. A189951

Number of finite sequences of distinct integer partitions with total sum n. A358906

Number of maximal subsets of {1..n} containing n such that every subset has a different sum. A325867

Numbers k such that the continued fraction for sqrt(k) has period 100. A20439

a(n) = a(n-1) + 2·a(floor(n/2)) if n > 0, otherwise 1. A58039

1/4 the number of arrangements of n+1 nonzero numbers x(i) in -3..3 with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero. A189945

1/4 the number of arrangements of 7 nonzero numbers x(i) in -n..n with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero. A189956

The number of maximal subsemigroups of the Jones monoid on the set [1..n]. A290140

Least nonnegative difference between two numbers whose digits are all taken from a cumulative list of n mod 10 (see example). A317231

Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number. A32701