8444
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 6340
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4220
- Möbius Function
- 0
- Radical
- 4222
- Omega Function (Ω)
- 3
- 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
- 171
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=27A020407
- Composite numbers k such that the digits of the prime factors of k are either 1 or 2.at n=40A036302
- Numerators of continued fraction convergents to sqrt(414).at n=6A041786
- Numbers having three 4's in base 10.at n=34A043507
- Numbers whose base-4 representation contains exactly three 0's and three 3's.at n=33A045079
- Triangle of number of permutations of [n] with 0 successions, by number of rises.at n=25A046740
- Numbers k such that 189*2^k-1 is prime.at n=32A050846
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=31A057287
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=36A058229
- Numbers k such that the first k nonary digits found in decimal expansion of Pi form a prime.at n=4A065576
- a(n) = (sum of first n primes)^2 - sum of squares of first n primes.at n=8A065595
- Write 2^n, 2^n+1, 2^n+2, ..., 2^(n+1)-1 in binary and add as if they were decimal numbers.at n=3A067895
- Generalized Motzkin paths with no hills and 3-horizontal steps.at n=18A099170
- Numbers k such that k*(k+9) gives the concatenation of two numbers m and m-5.at n=0A116258
- G.f. satisfies: A(x) = x + A(A(A(x)^2)).at n=8A141370
- Array read by antidiagonals of higher order Fubini numbers.at n=32A153278
- (Average of twin balanced prime pairs)/10.at n=30A173893
- Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers) .at n=53A193959
- Mirror of the triangle A193959.at n=45A193960
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=33A206261