10555
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 2117
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8440
- Möbius Function
- 1
- Radical
- 10555
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 having three 5's in base 10.at n=36A043511
- Composites in base 10 that remain composite in exactly five bases b, 2 <= b <= 10, expansions interpreted as decimal numbers.at n=44A256353
- Numbers k such that R_k + 60 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A256760
- Number of 5-ascent sequences of length n with no consecutive repeated letters.at n=6A264910
- Expansion of Product_{k>=1} (1 + x^(3*k))^(3*k) / (1 + x^k)^k.at n=33A285294
- Number T(n,k) of parts in all proper k-times partitions of n into distinct parts; triangle T(n,k), n >= 1, 0 <= k <= max(0,n-2), read by rows.at n=52A327632
- a(n) = Sum_{k=3..n} binomial(k-1,2) * floor(n/k).at n=38A366970
- Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k symmetric valleys, with k >= 0.at n=40A372875