Properties of the Number -23465

Twenty-Three Thousand Four Hundred Sixty-Five

Basics

Value: -23466 → -23465 → -23464

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 13 × 19 ²

Divisors: 1, 5, 13, 19, 65, 95, 247, 361, 1235, 1805

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101101110101001

Octal: -55651

Duodecimal: -116B5

Hexadecimal: -5ba9

Square: 550606225

Square Root: 153.18289721767243

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

Smallest Rhonda number to base b = n-th composite number, A002808(n). A255872

Number of partitions of n such that the absolute value of the difference between the number of odd parts and the number of even parts is <=1. A239835

Seventh partial sums of fourth powers (A000583). A254870

Number of partitions of n such that (greatest part) <= (multiplicity of least part). A240182

a(n) = ∑_k=0..n k⁴*binomial(2·n-k,n). A302352

Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n. A74348

a(n) = n*(n+1)*(n+7)*(122+57·n+n²)/120. A101862

Coefficient of·in the reduction of the n-th Fibonacci polynomial by x³->x²+1. A192782

p-INVERT of the positive integers, where p(S) = (1 - S)⁵. A290920

a(n) = 65·n². A165798