14379
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19176
- Proper Divisor Sum (Aliquot Sum)
- 4797
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9584
- Möbius Function
- 1
- Radical
- 14379
- 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
- 32
- 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 k whose decimal representation, read as a base-18 value and divided by k, yields an integer.at n=26A032567
- Number of partitions of n into parts 3k or 3k+1.at n=51A035360
- Smallest k for which k, 2k, ... nk all contain the digit 7.at n=5A039938
- Numerators of continued fraction convergents to sqrt(253).at n=8A041474
- Number of partitions of n into decimal repdigit numbers.at n=39A088669
- Number of partitions of n into decimal palindromes.at n=39A091580
- Shifts left when Euler transform applied 7 times.at n=7A144039
- Number of n X n arrays of squares of integers summing to 5 with every element equal to at least one neighbor.at n=5A146124
- Composite numbers n such that the distinct digits in n and the distinct digits in the proper divisors of n are the same.at n=9A237713
- Number of (n+1) X (4+1) 0..1 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=12A251124
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=7A254904
- Numbers k such that the set of all the decimal digits of k is the same as the set of all the decimal digits of the proper divisors of k.at n=10A282755
- A039938 with duplicates removed.at n=5A285846
- Number of connected dominating sets in the n-crown graph.at n=4A287471
- Number of n X n 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1's.at n=4A296828
- Number of nX5 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=4A296831
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s.at n=40A296834
- a(n) is the n-th term of the sequence that shifts left by one position when Euler transform is applied n times; a(0) = 0.at n=7A305725
- Numbers k such that the decimal expansion of k and 14^k both begin with 14.at n=15A352239