8533
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 1835
- 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
- 6864
- Möbius Function
- -1
- Radical
- 8533
- Omega Function (Ω)
- 3
- 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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Coordination sequence for alpha-Mn, Position Mn2.at n=24A009951
- Numbers k such that 29*2^k+1 is prime.at n=23A032364
- a(n+1) is smallest number with a(n+1)^n > a(n)^(n+1).at n=20A059923
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=15A066509
- Gregorian calendar years with Ascension Day in April.at n=34A084427
- a(n) = index of the first occurrence of n in A088606.at n=31A088757
- Dropping first and last digit of n leaves its largest prime factor.at n=33A114565
- n*(1+3*n+6*n^2)/2.at n=14A115519
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=61A122795
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n having k DD's (0 <= k <= n-1 for n >= 1).at n=40A128738
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=25A138853
- Triangle [1,1,1,0,0,0,...] DELTA [1,0,0,0,...] with Deléham DELTA defined in A084938.at n=47A147703
- 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), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=8A150034
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (n^2 +n -1)*T(n-2, k-1), read by rows.at n=24A154233
- a(n) is the n-th J_20-prime (Josephus_20 prime).at n=11A163800
- Triangle read by rows: T(n,k) is the sum of the k X k minors in the n X n Pascal matrix (0<=k<=n; the empty 0 X 0 minor is defined to be 1).at n=38A184173
- Triangle read by rows: T(n,k) is the sum of the k X k minors in the n X n Pascal matrix (0<=k<=n; the empty 0 X 0 minor is defined to be 1).at n=42A184173
- a(n) = floor(1/{(n^4+3*n)^(1/4)}), where {}=fractional part.at n=79A184637
- a(n) = 12*n^2 - 8*n + 1.at n=27A185212
- Triangle T(n,k), read by rows, given by (1,0,0,0,0,0,0,0,0,0,...) DELTA (1,1,1,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.at n=52A199479