14823
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22568
- Proper Divisor Sum (Aliquot Sum)
- 7745
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 0
- Radical
- 183
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^2-x^3-x^4-x^5).at n=25A013982
- Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.at n=28A014861
- Numbers k such that k divides s(k), where s(1)=1, s(j) = s(j-1) + j*13^(j-1).at n=14A014953
- a(n) = (d(n)-r(n))/2, where d = A026043 and r is the periodic sequence with fundamental period (1,1,0,0).at n=41A026044
- Sum of the prime factors of k equals half the sum of the prime factors of k + 1.at n=12A074213
- Expansion of (1-x)^(-1)/(1 - 2*x - x^2 - x^3).at n=10A077849
- Number of integer-sided hexagons having perimeter n.at n=32A124286
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x>3*y*z.at n=16A211918
- Numbers whose binary representation is palindromic and in which all runs of 0's and 1's have length at least 2.at n=47A222813
- a(1) = least k such that 1/2 + 1/3 < H(k) - H(3); a(2) = least k such that H(a(1)) - H(3) < H(k) -H(a(1)), and for n > 2, a(n) = least k such that H(a(n-1)) - H(a(n-2)) > H(k) - H(a(n-1)), where H = harmonic number.at n=8A227653
- Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 2 4 or 6.at n=4A251328
- Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock summing to 2 4 or 6.at n=0A251332
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 2 4 or 6.at n=10A251335
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 2 4 or 6.at n=14A251335
- Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=24A282039
- Numbers k such that 8*10^k + 51 is prime.at n=21A287296
- a(n) = [x^n] x/((1 - x)*(1 - 4*x)^(5/2)).at n=6A323223
- Lexicographically earliest sequence with a(n) odd digits among the first a(n+1) decimal digits, for any n; a(1) = 1, a(2) = 2.at n=34A332070
- Terms of A046337 for which A358777 is zero, where the latter is the Dirichlet inverse of former's characteristic function.at n=23A359607
- Number of compositions (ordered partitions) of n into prime power parts (not including 1) not greater than sqrt(n).at n=25A369221