5068
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10192
- Proper Divisor Sum (Aliquot Sum)
- 5124
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2160
- Möbius Function
- 0
- Radical
- 2534
- Omega Function (Ω)
- 4
- 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
- 33
- 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
- Coordination sequence for quartz.at n=40A008261
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8).at n=28A017821
- Pseudoprimes to base 65.at n=28A020193
- Numbers k such that 123*2^k+1 is prime.at n=18A032411
- Numbers whose base-4 representation contains exactly three 0's and three 3's.at n=18A045079
- Triangle formed from coefficients of the polynomials p(1)=x, p(n+1) = (n + x*(n+1))*p(n) + x*x*(d/dx)p(n).at n=17A075856
- a(n) = (1/24)*(n+1)*(n+3)*(n^2+22*n+88).at n=14A090950
- Number of all extensions over Q_3 with degree n in the algebraic closure of Q_3.at n=11A100977
- Numbers n whose abundance is 56.at n=42A101260
- a(n) = n! + Sum_{i=1..n} i.at n=7A101292
- Triangle read by rows: T(n,k) is the number of Dyck n-paths containing k even-length descents to ground level.at n=53A111301
- Number of errors that occur when choosing n as modulus in French INSEE code (0<n<100).at n=15A137385
- Number of distinct values obtained when each of the operators # in the expression 1#2#3#...#n is replaced by + (add) or x (multiply) in all possible ways, for n=1,2,3,...at n=13A138651
- Numerators of coefficients of series expansion of 1/(Bernoulli trial entropy), scaled to denominators A091137.at n=17A145178
- 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), (-1, -1, 1), (-1, 0, 0), (0, 1, 0), (1, -1, 0)}.at n=10A148117
- 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, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0)}.at n=7A150155
- Numbers k such that the string k modulo 1000 is found at position k in the decimal digits of Pi.at n=15A153226
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=16A162705
- Sum of primes between successive squares of primes.at n=5A175037
- Triangle T(n,k) read by rows: number of LCO forests of size n with k leaves, 1 <= k <= n.at n=48A175136