Properties of the Number 55989

Fifty-Five Thousand Nine Hundred Eighty-Nine

Basics

Value: 55988 → 55989 → 55990

Parity: odd

Prime: No

Previous Prime: 55987

Next Prime: 55997

Digit Sum: 36

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 6221

Divisors: 1, 3, 9, 6221, 18663, 55989

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101101010110101

Octal: 155265

Duodecimal: 28499

Hexadecimal: dab5

Square: 3134768121

Square Root: 236.61994844053194

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

Sum of the seventh largest parts in the partitions of n into 10 parts. A326592

Number of primes between successive powers of e (= 2.718281828...). A61273

a(n) = number of terms in s(n), where s(n) is defined in A096055. A112306

Imaginary Rabbits: imaginary part of a(0)=i; a(1)=-i; a(n) = a(n-1) + i·a(n-2), with i = sqrt(-1). A14291

Number of minimum dominating sets in the n-Hanoi graph. A381375

a(1) = 4; a(n) = (nⁿ⁺¹+2·n-3)/(n-1) for n > 1. A93149

a(n) is its own 4th difference. A55989

Let {s(i)}, i=0,1,2,... be a sequence of finite sequences with terms s(i)(j), j=1,2,3,... Start with s(0)={1}. Then, for k>0, let s(k) = s(k-1) U s(k-1) if s(k-1)(k)=0, s(k) = s(k-1) U {0} U s(k-1) if s(k-1)(k)=1, where s(i)(j) is the j-th element of s(i) and U denotes concatenation of the terms of the two operands. {a(n)} is the limit of s(k) as k goes to infinity. A96055

a(n) = n + A007978(n). A346563