14721
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 7743
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- -1
- Radical
- 14721
- 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
- 164
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of g.f. 1/((1-x)*(1-2*x)*(1-3*x)*(1-5*x)).at n=5A021024
- Pascal-(1,7,1) array.at n=40A081582
- Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=23A141029
- Duplicate of A081582.at n=40A143681
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 3X3 tee 1,1 1,2 1,3 2,2 3,2 in any orientation.at n=9A146013
- Number of isomorphism classes of n-fold coverings of a connected graph with Betti number 3.at n=4A152612
- Triangle T(n, k) = S(n, k) + S(n, n-k), where S are the Stirling numbers (A048993) of the second kind, read by rows.at n=49A154844
- Triangle T(n, k) = S(n, k) + S(n, n-k), where S are the Stirling numbers (A048993) of the second kind, read by rows.at n=50A154844
- a(n) = 11^n + 3^n - 1.at n=4A155623
- Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps).at n=45A158022
- Array read by antidiagonals: T(n,k) is the number of isomorphism classes of n-fold coverings of a connected graph with Betti number k (1 <= n, 0 <= k).at n=31A160449
- Number of isomorphism classes of 5-fold coverings of a connected graph with Betti number n.at n=3A160454
- a(n) = (4*n^3 - 9*n^2 + 11*n + 3)/3.at n=23A161707
- a(n) is the reverse concatenation of divisors of n.at n=13A176558
- a(n) = A176558(A175354(n)) = numbers m as reverse concatenations of divisors of numbers from A175354, where A175354 = numbers k such that reverse concatenations of divisors of k are nonprimes.at n=9A176588
- Hilbert series related to measurement of quantum entanglement - see Hero and Willenbring for precise definition.at n=4A176694
- a(n) = n*(17*n - 13)/2.at n=42A180232
- Number of 3's in the last section of the set of partitions of n.at n=42A182713
- Numbers n such that n divides the concatenation of all divisors in descending order.at n=5A224930
- Number of partitions of n into 7 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=31A244243