4514
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7068
- Proper Divisor Sum (Aliquot Sum)
- 2554
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2160
- Möbius Function
- -1
- Radical
- 4514
- 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
- 38
- 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
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=41A000123
- Coordination sequence T5 for Zeolite Code GOO.at n=46A008115
- Coordination sequence T2 for Zeolite Code SGT.at n=42A008230
- Numbers k such that the continued fraction for sqrt(k) has period 19.at n=29A020358
- Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=22A030504
- Numbers whose set of base-11 digits is {3,4}.at n=19A032835
- Number of n-node rooted trees of height at most 7.at n=12A034824
- Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=32A035953
- Numbers k such that k^16 == 1 (mod 17^3).at n=13A056088
- a(n) = a(n-1) + a(floor(n/2))^2 for n > 0, a(0) = 1.at n=9A067868
- The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).at n=9A073502
- a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).at n=51A077100
- Least k > n such that p(n) divides p(k), where p(k) denotes the k-th partition number (A000041).at n=44A079031
- Sum of composite numbers less than n-th prime.at n=28A079725
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=16A085607
- n*nextprime((n-1)!)-nextprime(n!).at n=46A089014
- Limit set for operation of repeatedly replacing a number with the sum of the 4th power of its digits.at n=7A113708
- Number of monic polynomials with integer coefficients of degree n with all roots on the unit circle; number of products of cyclotomic polynomials of degree n.at n=15A120963
- a(n) = a(n-2) - (n-1)*a(n-3), with a(0) = 0, a(1) = 1, a(2) = 2.at n=14A122021
- Numbers k such that the three numbers k-1, k+3 and k+5 are all prime.at n=38A144840