14324
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 25074
- Proper Divisor Sum (Aliquot Sum)
- 10750
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7160
- Möbius Function
- 0
- Radical
- 7162
- 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
- 102
- 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
- Least k such that decimal representation of k*n contains only digits 0 and 4.at n=30A096683
- Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=19A121089
- Row sums of triangle A134310.at n=11A134311
- a(n) = n^7 - (n-1)^7 + (n-2)^7 - ... + ((-1)^n)*0^7.at n=4A152726
- Partial sums of primes of the form (n+1)^7 - n^7.at n=1A221979
- Number of pairs (x, y) with 0 <= x, y <= n such that the distance between two points is a positive integer.at n=20A228108
- Number of isoscent sequences of length n with maximal number of ascents.at n=26A243237
- a(n) = floor((10*n^3 + 57*n^2 + 102*n + 72) / 72).at n=45A254875
- Number of terms of A072873 less than or equal to 10^n.at n=37A267757
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 379", based on the 5-celled von Neumann neighborhood.at n=6A270423
- Number of n X 2 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=15A279262
- Numbers n such that there are precisely 5 groups of orders n and n + 1.at n=37A295991
- a(n) = 108*n^2 - 104*n + 20 (n>=1).at n=11A304835
- Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance 2w apart where the walk starts at the middle point between the planes.at n=16A338125
- Numbers k such that A006577(k^3) sets a new record.at n=23A346593
- E.g.f. satisfies A(x) = exp( 2 * (exp(x*A(x)^(1/2)) - 1) ).at n=5A375867
- Numbers k such that the total number of digits d in the numbers from 1 to k is even for each d from 0 to 9.at n=30A380642