Properties of the Number 95121

Ninety-Five Thousand One Hundred Twenty-One

Basics

Value: 95120 → 95121 → 95122

Parity: odd

Prime: No

Previous Prime: 95111

Next Prime: 95131

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 13 × 271

Divisors: 1, 3, 9, 13, 27, 39, 117, 271, 351, 813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10111001110010001

Octal: 271621

Duodecimal: 47069

Hexadecimal: 17391

Square: 9048004641

Square Root: 308.41692560558346

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

Kaprekar numbers: positive numbers n such that n = q+r and n² = q·10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n ≠ 10^a, a >= 1. A6886

Another version of the Kaprekar numbers (A006886): n such that n = q+r and n² = q·10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n ≠ 10^a, a >= 1 and n an m-digit number. A53816

The full list of 5-Kaprekar numbers. A53396

Kaprekar numbers, allowing powers of 10: n such that n=q+r and n²=q·10^m+r, for some m >= 1, q>=0 and 0<=r<10^m. A248353

Square roots of terms in A238237. A290449

Period of the continued fraction for sqrt(5²ⁿ⁺¹). A293028

Numbers n such that for every k = 1, 2, ..., A305706(n)-1, it is possible to insert plus signs into the decimal representation of n^k to make sum equal n. A305707

Expansion of (1-x+2x²)/((1-x)*(1-2x)). A95121

Triangle T, read by rows, where T(n,k) = [T^{3^k}](n-k,0) * (3^k)^n-k for n>=k>=0 such that row n of the 3^n-1-th root of T consists solely of integers given by: [T^{1/3^(n-1} )](n,k) = (3^k)^n-k for n>=0. A274480

Positive integers n (with k digits) such that if a positive integer m with k+1 digits is divisible by n, then all the rotations of m are divisible by n. A360423