5070
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13176
- Proper Divisor Sum (Aliquot Sum)
- 8106
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1248
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that 2^(2k+1) + 2^(k+1) + 1 is prime.at n=11A006599
- Coordination sequence T1 for Zeolite Code VSV.at n=46A009914
- Specific heat coefficients for square lattice spin 1 Ising model.at n=9A010111
- a(n) is least k such that k and 6k are anagrams in base n (written in base 10).at n=7A023098
- a(n) = binomial(2*n-1, n) - binomial(2*n-1, n+3).at n=7A026016
- a(n) = T(n, [n/2]), where T is the array defined in A026009.at n=15A026021
- Decimal part of a(n)^(1/n) starts with a 'nine digits' anagram.at n=15A035136
- T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.at n=30A050158
- T(n,k) = S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=39A050159
- Starting positions of strings of 2 0's in the decimal expansion of Pi.at n=37A050201
- Numbers k such that k | sigma_6(k).at n=27A055710
- Maximal term in trajectory of P under the 'Px+1' map, where P = n-th prime, or -1 if no such term exists.at n=10A057689
- a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.at n=46A061866
- First (leftmost) digit - second digit + third digit - fourth digit .... = 12.at n=32A061881
- Numbers k such that k and its reversal are both multiples of 15.at n=11A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=7A062914
- Number of regions in regular n-gon which are quadrilaterals (4-gons) when all its diagonals are drawn.at n=22A067151
- Numbers k such that phi(k) divides sigma(k+1) + sigma(k).at n=39A067246
- Numbers k such that sigma_k(k)/k is an integer, where sigma_k(k) is the sum of the k-th powers of the divisors of k (A023887).at n=37A067313
- Expansion of (1+x^2*C^4)*C, where C = (1 - sqrt(1-4*x))/(2*x) is g.f. for Catalan numbers, A000108.at n=8A071725