14802
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29616
- Proper Divisor Sum (Aliquot Sum)
- 14814
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4932
- Möbius Function
- -1
- Radical
- 14802
- 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
- 71
- 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
- Representation degeneracies for boson strings.at n=33A005292
- Numbers whose base-11 representation has exactly 5 runs.at n=26A043648
- McKay-Thompson series of class 20E for Monster.at n=22A058554
- Numbers which are the sum of their proper divisors containing the digit 4.at n=24A059463
- Numbers k such that 2^k - prime(k) is prime.at n=16A078583
- Terms m of A003337 such that m+1 is also in A003337. I.e., smaller one of two consecutive numbers, both equal to a sum of three 4th powers.at n=3A085322
- Numbers n such that n/6 and prime(n)+/-n are all primes.at n=24A105550
- Numbers k such that either 2^k + prime(k) or 2^k - prime(k) is prime.at n=40A130640
- 6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes.at n=35A178145
- Number of length n 0..3 arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=6A244827
- T(n,k) = Number of length n 0..k arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=42A244832
- Number of length 7 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=2A244838
- Logarithmic derivative of the g.f. of the solid partitions A000293.at n=18A277613
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A299609
- Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^(3*k))/(1 - x^k).at n=34A304630
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=38A320719
- Numbers that are the sum of seven fourth powers in five or more ways.at n=33A345571
- Numbers that are the sum of seven fourth powers in exactly five ways.at n=32A345827
- Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of curved edges constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections.at n=49A374339
- Triangle read by rows: T(n,k) is the number of free polyforms consisting of k unit square cells and n-k isosceles right triangular cells whose short sides have unit length. Cells are joined along sides of equal lengths.at n=42A391193