5102
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7656
- Proper Divisor Sum (Aliquot Sum)
- 2554
- 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
- 2550
- Möbius Function
- 1
- Radical
- 5102
- 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
- 85
- 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
- yes
- Odd
- no
Appears in sequences
- Exponential self-convolution of numbers of rooted trees on n nodes.at n=7A006850
- Coordination sequence T4 for Zeolite Code AFO.at n=47A008018
- Number of partitions of n into at most 7 parts.at n=38A008636
- Coordination sequence for MgNi2, Position Ni1.at n=18A009933
- a(n) = 3rd elementary symmetric function of the first n+2 primes.at n=3A024448
- a(n) = floor(binomial(2*n,n)/3^n).at n=38A024503
- Number of partitions of n in which the greatest part is 7.at n=45A026813
- T(2n,n+3), T given by A026758.at n=5A026874
- a(n) = Sum_{k=0..2n} (k+1) * A027082(n, 2n-k).at n=7A027107
- 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 70.at n=16A031568
- Denominators of continued fraction convergents to sqrt(710).at n=10A042367
- a(n)=(s(n)+5)/10, where s(n)=n-th base 10 palindrome that starts with 5.at n=32A043084
- Numbers having three 8's in base 9.at n=6A043487
- Numbers whose base-3 representation contains exactly one 0 and no 1's.at n=22A044970
- Numbers k such that k^8 == 1 (mod 9^3).at n=13A056084
- Number of elements e in all partitions of n such that e divides n.at n=21A089251
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(sqrt(2 * (a(n-2)^2 + a(n-1)^2))).at n=19A093332
- a(n) = sum of n-th column in array in A100452.at n=17A100454
- Triangle, read by rows, where T(n,k) equals number of distinct partitions of triangular number n*(n+1)/2 into k different summands for n>=k>=1.at n=61A104382
- G.f.: Product_{i>=1} (1 - 2*(-x)^i)/(1 - (-x)^i)^2.at n=34A104510