14829
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19776
- Proper Divisor Sum (Aliquot Sum)
- 4947
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9884
- Möbius Function
- 1
- Radical
- 14829
- 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
- 133
- 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
- Numbers k in which the digits of k^2 appear.at n=25A029774
- Numbers k such that k and k^2 have the same set of digits.at n=13A029793
- a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=30A050067
- Numbers k such that 2^k + 3*k is prime.at n=19A093988
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=33A117720
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 8 and 9.at n=25A137000
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (-1, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=9A148743
- Row sums of A163233 and A163235.at n=29A163242
- Shifts 8 places left under Euler transform with a(0)=0 and a(n)=1 for n<8.at n=34A218025
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+2k)^k for 0 <= k <= n .at n=46A248829
- Zeroless numbers n such that n and n^2 have the same set of decimal digits.at n=4A257763
- Numbers n such that both n and n squared contain exactly the same digits, and n is not divisible by 10.at n=7A258231
- Expansion of Product_{k>=1} (1 - x^(8*(2*k-1))) * (1 - x^(8*k)) / (1 - x^k).at n=38A280938
- Partial sums of A299898.at n=30A299899
- Numbers k such that 4*k + 3 is a perfect cube, sorted by absolute values.at n=19A305291
- G.f.: Product_{k>=1, j>=1} (1 + x^(k*j))^2 / (1 - x^(k*j)).at n=11A320244
- Number of compositions of n into distinct parts such that the difference between adjacent parts is at least two.at n=30A328222
- T(n,k) is the number of 4-ary strings of length n+1 with k+1 indispensable digits and a nonzero leading digit with 0 <= k <= n.at n=38A340620
- T(n,k) is the number of 4-ary strings of length n+1 with k+1 indispensable digits and a nonzero leading digit with 0 <= k <= n.at n=42A340620
- Numbers X such that X^2 + Y^2 = 3^(2*k) + 1 and X > Y > 0 and k is the ternary digit length of X-1.at n=16A369768