Properties of the Number 95320

Ninety-Five Thousand Three Hundred Twenty

Basics

Value: 95319 → 95320 → 95321

Parity: even

Prime: No

Previous Prime: 95317

Next Prime: 95327

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 2383

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 2383, 4766

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10111010001011000

Octal: 272130

Duodecimal: 471B4

Hexadecimal: 17458

Square: 9085902400

Square Root: 308.73937228672344

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

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Fibonacci numbers). A24318

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (F(2), F(3), ...). A24322

Fibonacci sequence beginning 5, 11. A22136

Main diagonal of the Stolarsky array. A35489

a(n) = k·Fibonacci(2·n+1) + (k+1)*Fibonacci(2·n), where k=5. A271359

Main diagonal of Wythoff array: w(n,n)=[ n*τ ]F(n+1)+(n-1)F(n), where τ=(1+sqrt(5))/2, F(n) = Fibonacci numbers. A20941

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (F(2), F(3), F(4), ...). A24885

Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 3. A95320