11828
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20706
- Proper Divisor Sum (Aliquot Sum)
- 8878
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5912
- Möbius Function
- 0
- Radical
- 5914
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 24
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=31A015991
- a(n)^3 is smallest cube containing exactly n 5's.at n=5A048370
- Numbers k such that prime(k) + prime(k+1)*2 is a square.at n=24A064504
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=30A065215
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.at n=33A070996
- Triangle read by rows: T(n,0)=1, T(n,n)=(2*n-1)!!+1, T(n,k) = 2*(n-k) * T(n-1,k-1) + 2*(k+1)*T(n-1,k).at n=29A099755
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, 1), (1, 0, -1)}.at n=10A148309
- Partial sums of prime numbers of measurement A002049.at n=31A173702
- A185243(n) is the a(n)-th triangular number.at n=44A185257
- Number of (n+1) X 2 binary arrays with every 2 X 2 subblock sum equal to some horizontal or vertical neighbor 2 X 2 subblock sum.at n=7A185489
- Number of (n+1)X9 binary arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum.at n=0A185496
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum.at n=28A185497
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum.at n=35A185497
- a(n) = 4*n^2 + 3*n + 2.at n=54A185669
- Number of (n+1)X9 binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums.at n=0A188310
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums.at n=28A188311
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums.at n=35A188311
- Triangle T(n,k), n>=0, 0<=k<=3n, read by rows: row n gives the coefficients of the chromatic polynomial of the complete tripartite graph K_(n,n,n), highest powers first.at n=20A212220
- Coordination sequence for (2,5,7) tiling of hyperbolic plane.at n=21A265066
- Two-column array read by rows, where the n-th row is the least pair of integers (p, q) such that f(p) = f(n) + q*f(n+1) where f(n) = A002496(n) is the n-th prime of the form k^2+1.at n=23A352582