Properties of the Number 11155

Eleven Thousand One Hundred Fifty-Five

Basics

Value: 11154 → 11155 → 11156

Parity: odd

Prime: No

Previous Prime: 11149

Next Prime: 11159

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 23 × 97

Divisors: 1, 5, 23, 97, 115, 485, 2231, 11155

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101110010011

Octal: 25623

Duodecimal: 6557

Hexadecimal: 2b93

Square: 124434025

Square Root: 105.61723344227494

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

Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1). A11971

Partial sums of A299281. A299282

a(n) = n³ + n² + n + 1. A53698

Triangle of Gaussian binomial coefficients [ n,k ] for q = 22. A22186

Numbers using only digits 1 and 5. A276037

Difference array of Bell numbers A000110 read by antidiagonals. A106436

Triangle read by rows: Aitken's array (A011971) but with a leading diagonal before it given by the Bell numbers (A000110), 1, 1, 2, 5, 15, 52, ... A95149

Odd composite numbers k such that A053575(k) [the odd part of φ] divides k-1. A339880

Iccanobirt numbers (2 of 15): a(n) = a(n-1) + R(a(n-2)) + a(n-3), where R is the digit reversal function A004086. A102112

Integers that need 10 iterations of the map x->A352172(x) to reach 1. A352268