11414
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 7066
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5256
- Möbius Function
- -1
- Radical
- 11414
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 29
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=18A014563
- Numbers whose set of base-10 digits is {1,4}.at n=35A032822
- Denominators of continued fraction convergents to sqrt(889).at n=10A042719
- Starting from generation 7 add previous and next term yielding generation 8.at n=23A048454
- McKay-Thompson series of class 28D for Monster.at n=31A058609
- 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, 0), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150775
- Number of length-n 0..6 arrays connected end-around, with no sequence of L<n elements immediately followed by itself (periodic "squarefree"), and new values introduced in order 0..6.at n=9A215399
- Number of idempotent 3X3 0..n matrices.at n=28A222822
- Number of distinct values of the sum of i^2 over 7 realizations of i in 0..n.at n=41A225274
- Sum of the middle parts in the partitions of 4n-1 into 3 parts.at n=19A240707
- Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=24A242489
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=29A244343
- Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=30A244343
- Numbers whose digit string can be partitioned into three nonempty parts a < b <= c such that a*b = c.at n=40A280733
- Numbers that contain exactly one pair of identical digits x and a triple of identical digits y (x not equal y).at n=24A291312
- p-INVERT of (1,0,0,1,0,0,0,0,0,0,...), where p(S) = 1 - S^2.at n=32A292402
- Numbers missing from A317415.at n=16A317417