14580
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 45906
- Proper Divisor Sum (Aliquot Sum)
- 31326
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of paraffins.at n=16A006009
- Triangle of coefficients in expansion of (1+9x)^n.at n=24A013616
- Number of reversible strings with n labeled beads of 3 colors.at n=4A032108
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=24A038221
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*10^j.at n=22A038228
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*9^j.at n=13A038251
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=24A038291
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*5^j.at n=11A038295
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*3^j.at n=26A038305
- A convolution triangle of numbers obtained from A025748.at n=22A048966
- Composite numbers k such that sigma(k) / d(k) is prime.at n=18A048969
- Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers.at n=19A057370
- Consider the solutions to k = a+b = x*y and a*b = k*(x+y) where k, a, b, x, and y are all positive integers, ordered by increasing k and, in case of ties, by increasing x. Sequence gives values of a*b.at n=10A057421
- Numbers which can be written as b^2*c^2*(b^2+c^2).at n=21A063663
- Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).at n=29A064010
- Numbers which can be expressed as the product of a number and its reversal in at least two different ways.at n=9A066531
- Sum of 2nd, 4th, 6th, 8th and 10th powers of divisors are divisible by sum of divisors.at n=6A074471
- Numbers k such that the sum of 2nd, 3rd, 4th and 5th powers of divisors of k are divisible by sum of divisors of k.at n=9A074632
- Riordan array (1, 3+3x).at n=51A099093
- a(1) = 1, a(n+1) = a(n)/T(n+1), if T(n+1) divides a(n), else a(n+1) = a(n) *T(n+1), where T(n) = n*(n+1)/2 is a triangular number (A000217).at n=8A111465