10260
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 33600
- Proper Divisor Sum (Aliquot Sum)
- 23340
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2592
- Möbius Function
- 0
- Radical
- 570
- Omega Function (Ω)
- 7
- 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
- 55
- 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
- Infinitary sociable numbers (smallest member of cycle).at n=2A004607
- Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.at n=18A007886
- Coordination sequence for CaF2(1), Ca position.at n=34A009923
- Floor[n(n-1)(n-2)(n-3)/14].at n=21A011924
- Numbers k such that sigma(k) = 2*usigma(k).at n=29A063880
- Numbers k such that tau_3(k) (the number of ordered factorizations of k as k = r*s*t) divides k.at n=43A069147
- a(n)= Sum_{d divides n} a(abs(n/d-d)).at n=14A079580
- a(n) = Sum_{k=1..n} k*(prime(k) - k).at n=18A110477
- Group the triangular numbers so that the n-th group sum is a multiple of n. 1, (3, 6, 10, 15), (21), (28), (36, 45, 55, 66, 78), (91, 105, 120, 136, 153, 171, 190), ... Sequence contains n-th group sum divided by n.at n=20A114032
- Expansion of q^(-1/2)(eta(q^3)/eta(q))^6 in powers of q.at n=8A121596
- a(n) = 5*n^2 + 3*n.at n=44A126264
- The n-th arithmetic derivative of 3^4.at n=7A129151
- Sums of the products of n consecutive pairs of numbers.at n=19A135036
- Number of parenthesizings of products formed by n factors assuming nonassociativity and partial commutativity: individual factors commute, but bracketed expressions don't commute with anything.at n=5A137591
- Irregular triangle from the expansion of p(x,t) = exp(x*t)/(x - t/2 - t/(exp(t) - 1)).at n=37A138169
- a(n) = n*(8*n - 3).at n=36A139273
- a(n) = 250*n + 10.at n=40A154379
- a(n) = 144*n^2 - 161*n + 45.at n=8A156711
- Even numbers which are the sum of two odd abundant numbers.at n=34A168226
- Numbers of the form p^3*q^2*r*s where p, q, r, and s are distinct primes.at n=22A179700