14471
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15000
- Proper Divisor Sum (Aliquot Sum)
- 529
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13944
- Möbius Function
- 1
- Radical
- 14471
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 120
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = 10000*log_10(n) rounded down.at n=27A004228
- Number of n-node rooted identity trees of height 5.at n=16A038089
- Numbers having four 5's in base 6.at n=30A043392
- Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.at n=47A083041
- Number of nX3 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=23A166781
- Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/(2*sqrt(1-4x))).at n=50A188481
- Number of Pythagorean triangles (x, y, z) with legs x < y < 10^n.at n=3A239786
- Put a [+] b = A(A(a) + A(b)), where A=A007913. The sequence lists consecutive row "sums" of triangle A248473, using [+].at n=26A249388
- a(n) = Sum_{i=1..n, j=1..n, gcd(i,j)=2} (n+1-i)*(n+1-j).at n=23A331761
- Number of integer partitions of n whose weighted sum is not divisible by n.at n=34A362560
- Numbers k such that the k-th run-length A110969(k) of the sequence of non-prime-powers (A024619) is different from all prior run-lengths.at n=42A373670