14160
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 44640
- Proper Divisor Sum (Aliquot Sum)
- 30480
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3712
- Möbius Function
- 0
- Radical
- 1770
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=29A031174
- Numbers k such that 177*2^k+1 is prime.at n=45A032465
- a(n) = (n^2 - 1)*(n^2 - 3).at n=11A033596
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(2,5) + cn(3,5).at n=35A039845
- Numbers n such that n | Sigma_2(n) + Sigma_1(n) + Sigma_0(n).at n=14A057852
- a(0)=1, a(n) = 8*n*(2*n-1).at n=30A067239
- Numbers k such that d(phi(k)) = phi(d(k)), where d=A000005 and phi=A000010.at n=27A078148
- Indices of primes in sequence defined by A(0) = 23, A(n) = 10*A(n-1) - 17 for n > 0.at n=19A101953
- Number of nondecreasing Dyck paths of semilength n and having no peaks at odd level (n>=0). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.at n=16A121482
- a(n) = (2*n+1)*(n+1)*(2*n^2+3*n-1).at n=7A123197
- a(1) = 1; for n >= 1, a(n+1) is obtained by adding to a(n) the a(n)-th smallest number not dividing a(n).at n=12A140481
- Nonsquarefree numbers such that n-1 is prime and n+1 is square.at n=28A146980
- Eight times hexagonal numbers: a(n) = 8*n*(2*n-1).at n=30A152750
- 3 times octagonal numbers: a(n) = 3*n*(3*n-2).at n=40A152751
- Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=22A163393
- Numbers such that the two adjacent integers are a perfect square and a prime.at n=44A163492
- Number of binary strings of length n with no substrings equal to 0010 0101 or 1001.at n=13A164493
- Sum of the numbers already removed (including the target number) in the first jump of a Sieve of Eratosthenes table.at n=27A179654
- The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs).at n=23A180577
- Q-residue of the triangle A094727, where Q=Pascal's triangle. (See Comments.)at n=6A193659