10755
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 7965
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- 0
- Radical
- 3585
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- no
- Odd
- yes
Appears in sequences
- Multiplicity of highest weight (or singular) vectors associated with character chi_142 of Monster module.at n=38A034530
- Numbers k such that k | 12^k + 11^k + 1.at n=29A057293
- Numbers k such that 2*5^k + 3 is prime.at n=18A057914
- A106486-encodings of combinatorial games equivalent to game {0|0}.at n=28A125994
- 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, 0), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150652
- Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth exactly g.at n=13A185140
- Number of not necessarily connected 4-regular simple graphs on n vertices with girth exactly 3.at n=13A185143
- Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 3.at n=82A185643
- Number of partitions of n into distinct parts with boundary size 6.at n=43A227563
- Let s denote the sum of the deficient numbers in the aliquot parts of x. Sequence lists numbers x such that sigma(s) = usigma(x), where usigma(x) is the sum of the unitary divisors of x (A034448).at n=5A258134
- Integers k such that A086167(k) and A086168(k) are both prime.at n=42A270563
- The number of solutions to phi(x) = phi(x+1) below 10^n, where phi(x) is the Euler totient function.at n=12A300285
- Number of n element multisets of the 15th roots of unity with zero sum.at n=42A321418
- Expansion of Product_{k>=1} (Product_{j=1..k} (1 + x^(k*j))^j).at n=31A327063
- a(n) = A337339(n) - n.at n=49A337341
- a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square.at n=21A384208