Properties of the Number -23475

Twenty-Three Thousand Four Hundred Seventy-Five

Basics

Value: -23476 → -23475 → -23474

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 313

Divisors: 1, 3, 5, 15, 25, 75, 313, 939, 1565, 4695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101101110110011

Octal: -55663

Duodecimal: -11703

Hexadecimal: -5bb3

Square: 551075625

Square Root: 153.2155344604456

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

Expansion of cos(log(1+x))/exp(x). A9027

G.f. A(x) satisfies: A(x)² = A( x² + 2·A(x)³ ), with A(0)=0, A'(0)=1. A271959

The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors. A309528

Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees). A79219

Number of identity bracelets of n beads of 5 colors. A32242

Composites that are the sum of two, three, four and five consecutive composite numbers. A151745

Number of irregular primes less than or equal to the m-th prime, where m = floor(exp(n)). A105466

Magic sums of 3 X 3 semimagic squares composed of odd squares. A269297

Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram). A349409

Binomial transform of [1, 2, 3, 4, 0, 0, 0, ...]. A139488