8051
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8232
- Proper Divisor Sum (Aliquot Sum)
- 181
- 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
- 7872
- Möbius Function
- 1
- Radical
- 8051
- Omega Function (Ω)
- 2
- 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
- 70
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers that are the sum of 3 positive 5th powers.at n=38A003348
- Number of partitions of n in which no part occurs just once.at n=52A007690
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 89.at n=10A031587
- Numbers k such that 255*2^k+1 is prime.at n=33A032504
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=43A035564
- (s(n)+2)/10, where s(n)=n-th base 10 palindrome that starts with 8.at n=27A043087
- n-th 6k+1 prime times n-th 6k-1 prime.at n=10A048629
- Number of positive integers <= 2^n of form 3 x^2 + 5 y^2.at n=16A054162
- a(n) = 2^n + 3^n + 6^n.at n=5A074528
- Number of integers in {1, 2, ..., Fibonacci(n)} that are coprime to n.at n=21A074934
- A Pell-related fourth-order recurrence.at n=7A084155
- Maximal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).at n=61A086376
- (-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).at n=60A086394
- n^2-79*n+1601 as n runs through the lucky numbers.at n=27A087867
- a(n) = prime(n)*prime(n+2).at n=22A090076
- Numbers which are numerators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n.at n=27A094509
- Number of connected 3-element multiantichains on a labeled n-set.at n=6A094735
- Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=34A096554
- Generalized harmonic number H(n,5) = Sum_{k=1..n} 1/k^5 multiplied by (n!)^5.at n=3A099827
- Numerator of the generalized harmonic number H(n,5) = Sum_{k=1..n} 1/k^5.at n=2A099828