10740
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 19500
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2848
- Möbius Function
- 0
- Radical
- 5370
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- a(n) = dot_product(n,n-1,...2,1)*(5,6,...,n,1,2,3,4).at n=31A026060
- a(n) = (d(n)-r(n))/2, where d = A026066 and r is the periodic sequence with fundamental period (1,0,0,0).at n=38A026067
- a(n) = Sum_{k=0..n} (k+1) * A026615(n,k).at n=10A026960
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=23A066961
- Total number of parts that appear exactly once in the partitions of n into odd parts.at n=53A116665
- a(n) = 2*n*(6*n-1).at n=30A126964
- Triangle read by rows, coefficients of the polynomials P(k, x) = (1/2) Sum_{p=0..k-1} Stirling2(k, p+1)*x^p*(1-4*x)^(k-1-p)*(2*p+2)!/(p+1)!.at n=23A142963
- a(n) = Sum_{j=1..prime(n)-1} floor(j^2/prime(n)).at n=41A165993
- Number of paths from (0,0) to (n+2,n) using only up and right steps and avoiding two or more consecutive moves up or three or more consecutive moves right.at n=39A177787
- a(n) = 2^n*C(n-1)-y(n), where y(n) = Sum_{i=1..n-1} (2^i*C(i-1)-y(i))*(2^(n-i)*C(n-i-1)-y(n-i)), y(0)=0, y(1)=1 and where C(i) is the i-th Catalan number.at n=6A192482
- Number of primes p such that sqrt(q) - sqrt(p) > 1/n, where q is the prime after p.at n=42A218015
- Concatenation of n-th prime and n-th nonprime.at n=27A253910
- Numbers n such that the decimal expansions of both n and n^2 have 0 as smallest digit and 7 as largest digit.at n=41A256634
- Number of 4Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=7A281403
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic nonresidues mod p that are > p/2.at n=13A282725
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = (2k+1)^2 - 2 (A073577).at n=38A293620
- a(n)/2^n is the expected value of the length of the longest palindromic suffix of a random length-n binary string.at n=10A320303
- Row sums of a triangle based on A261327.at n=39A349118
- Numbers k such that 3^k + 5^k + 7^k + 11^k + 13^k is prime.at n=11A352393
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=11A353365