8847
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12792
- Proper Divisor Sum (Aliquot Sum)
- 3945
- 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
- 5892
- Möbius Function
- 0
- Radical
- 2949
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- 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
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=23A026101
- Let C(n) = product of composite numbers between the n-th prime and (n+1)-th prime; a(n) = floor(C(n+1)/C(n)).at n=20A073836
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) - 9 for n > 0.at n=23A101517
- <h[d+1,d-1],s[d,d]*s[d,d]*s[d,d]> where h[d+1,d-1] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions.at n=29A115376
- Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044.at n=49A157046
- a(n) = floor(sqrt(2*n^5)).at n=33A172473
- Records of minima of the positive distance d between the eleventh power of a positive integer x and the square of an integer y such that d = x^11 - y^2 (x <> k^2 and y <> k^11).at n=2A179793
- Differences between odd powers of 6 and the next smaller square.at n=5A201122
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209576; see the Formula section.at n=61A209575
- Sum of all aliquot divisors of all positive integers <= prime(n).at n=38A244578
- Numbers k such that 10^k - 801 is prime.at n=24A271618
- Where the zeros in A123066 occur.at n=19A321962
- Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 8, up to isomorphism.at n=45A358248
- G.f. satisfies A(x) = 1 + x * A(x * (1 - x^2)).at n=16A360896
- Triangle read by rows where T(n,k) is the number of unlabeled loop-graphs on up to n vertices with k loops and n-k non-loops.at n=57A368836
- Consecutive internal states of the linear congruential pseudo-random number generator (205*s + 29573) mod 139968 when started at 1.at n=34A383127
- One third the number of solid partitions of n with 6 parts.at n=15A389773