11879
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13584
- Proper Divisor Sum (Aliquot Sum)
- 1705
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10176
- Möbius Function
- 1
- Radical
- 11879
- Omega Function (Ω)
- 2
- 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
- 73
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=30A045216
- a(n) = prime(n)^2 - 2.at n=28A049001
- Frobenius number of the numerical semigroup generated by consecutive squares.at n=8A069756
- Integer part of the area of consecutive prime sided isosceles triangles.at n=37A097442
- a(n) = 6*n*(n-1) - 1.at n=45A103115
- a(n) = prime(n)*prime(n+1) + prime(n) + prime(n+1).at n=27A126199
- Numbers n where either n or n+1 is divisible by the numbers from 1 to 12.at n=1A131662
- Numbers k such that either k or k+1 is divisible by the numbers from 1 to 10.at n=17A131663
- Numbers k such that A098572(k) - A098572(k-1) = 2.at n=44A133497
- 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, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0)}.at n=10A148114
- Partials sums of A001694.at n=44A174172
- Number of n X n 1..2 arrays with every element value z a city block distance of exactly z from another element value z.at n=3A209602
- Number of nX4 1..2 arrays with every element value z a city block distance of exactly z from another element value z.at n=3A209606
- T(n,k)=Number of nXk 1..2 arrays with every element value z a city block distance of exactly z from another element value z.at n=24A209610
- The least number having n representations as p*q - p - q for primes p <= q.at n=8A218862
- Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=23A231558
- (2^(p-1) modulo p^2) + (3^(p-1) modulo p^2), where p = prime(n).at n=27A240987
- Numbers k such that (112*10^k + 17)/3 is prime.at n=24A273063
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 606", based on the 5-celled von Neumann neighborhood.at n=30A273206
- The smallest number k such that k*2^n mod 3^n = 1.at n=8A283754