8253
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13728
- Proper Divisor Sum (Aliquot Sum)
- 5475
- 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
- 4680
- Möbius Function
- 0
- Radical
- 2751
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 39
- Smith Number
- yes
- 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
- Arrays of dumbbells.at n=12A002940
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=29A014302
- Expansion of 1/((1-x)(1-2x)(1-4x)(1-7x)).at n=4A021079
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=43A029580
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=16A031903
- Odd numbers with exactly 4 palindromic prime factors (counted with multiplicity).at n=44A046374
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=20A083752
- Sum of the first n pairs of consecutive primes (for example, a(3) = (2+3) + (3+5) + (5+7) = 25).at n=44A102724
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...).at n=31A124574
- a(n) = sum of squares of first n odd primes.at n=12A133547
- Sums of three Mersenne primes.at n=25A174055
- Numbers n such that 30n+{11, 13, 17, 19, 23} are 5 consecutive primes.at n=15A182279
- The Wiener index of the para-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references).at n=6A216112
- Number of (n+4) X 8 0..1 matrices with each 5 X 5 subblock idempotent.at n=10A224686
- Position of first occurrence of n in continued fraction for Copeland-Erdos constant.at n=56A224891
- Number of Carlitz compositions of n with exactly seven descents.at n=4A241697
- Number of partitions of n with difference -3 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=39A242689
- Least number k >= 0 such that (n!+k)/n is prime.at n=62A245695
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=1A252636
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=11A252640