5015
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 1465
- 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
- 3712
- Möbius Function
- -1
- Radical
- 5015
- Omega Function (Ω)
- 3
- 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
- 41
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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 8 positive 7th powers.at n=22A003375
- Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).at n=35A007979
- Coordination sequence T8 for Zeolite Code MFI.at n=45A008171
- Coordination sequence T1 for Zeolite Code MFS.at n=44A008173
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=33A024875
- Numerators of continued fraction convergents to sqrt(751).at n=6A042446
- Denominators of continued fraction convergents to sqrt(974).at n=9A042885
- Numbers whose base-5 representation contains exactly three 0's and two 3's.at n=11A045201
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=25A053521
- Numbers n such that phi((prime(n)+1)/2)=sigma(n).at n=21A068473
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=2A075605
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=4A075606
- Numbers n such that sigma(n) = sigma(n+1) - sigma(n-1).at n=5A076530
- Numbers n such that ((n-1)^2+1)/2 and n^2+1 and ((n+1)^2+1)/2 are prime if n is even or (n-1)^2+1 and (n^2+1)/2 and (n+1)^2+1 are prime if n is odd.at n=27A082612
- Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.at n=17A090833
- Numbers k such that 6*k+1, 6*k+7, 6*k+13, 6*k+19 are consecutive primes.at n=7A090839
- Number of distinct values of i*j + j*k + k*i with 1 <= i <= j <= k <= n.at n=48A100440
- First differences of A112069.at n=0A112139
- Self-describing sequence. See the sequence as a succession of digits: then a(n) is the position of a composite digit in the sequence.at n=50A114318
- Number of partitions with maximum rectangle n.at n=14A115724