14910
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 41472
- Proper Divisor Sum (Aliquot Sum)
- 26562
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- -1
- Radical
- 14910
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 71
- 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
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=35A000330
- Even square pyramidal numbers.at n=16A015222
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=34A024598
- Number of partitions of n into parts not of the form 19k, 19k+9 or 19k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=37A035978
- Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.at n=34A059774
- a(n) = (n/2)*(n + 1)*(3*n + 11).at n=19A059997
- Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.at n=25A065655
- Numbers k such that Sum_{d divides k} sigma(d)/phi(d) is an integer.at n=25A068991
- Smallest multiple of n beginning with the n-th prime.at n=34A078208
- a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).at n=35A081861
- Least area/6 of primitive Pythagorean triangles with odd leg 2n+1.at n=34A096893
- Structured rhombic dodecahedral numbers (vertex structure 9).at n=17A100157
- Numbers n such that n divides the denominator of 2n-th Bernoulli number.at n=33A106741
- Sequence and first differences include all square numbers exactly once.at n=34A109678
- Sum of the first n^2 squares.at n=5A109764
- Triangle, read by rows, equal to the matrix inverse of P=A113370.at n=22A114156
- a(0)=0; then a(4*k+1)=a(4*k)+(4*k+1)^2, a(4*k+2)=a(4*k+1)+(4*k+3)^2, a(4*k+3)=a(4*k+2)+(4*k+2)^2, a(4*k+4)=a(4*k+3)+(4*k+4)^2.at n=35A115391
- 1/24 of product of three numbers: n-th prime, previous and following number.at n=18A127922
- Records for unitary abundant numbers, i.e., those integers which set a record for having a greater unitary abundance than any of their predecessors.at n=37A129499
- A triangular array distributing the values of sequence A120380.at n=34A160645