10695
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 7737
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 10695
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- a(n) = (2*n-1)*(3*n-1)*(4*n-1).at n=8A033589
- One seventh of octo-factorial numbers.at n=3A034975
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.at n=14A071141
- Numbers n such that (i) the sum of the distinct primes dividing n is divisible by the largest prime dividing n and (ii) n has exactly 4 distinct prime factors and (iii) n is squarefree.at n=3A071143
- Squarefree numbers k such that the largest prime factor of k is equal to the sum of the other prime factors of k.at n=14A071312
- Numbers k such that 2^k - prime(k) is prime.at n=15A078583
- Triangle T(n,k) read by rows: permutations on 123...n with one abc pattern and no aj pattern with j<=k, n>2, k<n-1.at n=39A084249
- A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.at n=14A094952
- McKay-Thompson series of class 24g for the Monster group.at n=51A112164
- Primitive elements of A119432.at n=21A119433
- Recurrence sequence derived from the digits of the square root of 3 after its decimal point.at n=27A120482
- Numbers k such that k^2 is a sum of consecutive cubes larger than 1.at n=42A126200
- Ramanujan numbers (A000594) read mod 23^3.at n=3A126847
- Numbers k such that either 2^k + prime(k) or 2^k - prime(k) is prime.at n=38A130640
- Numbers of the form 86+p^2 (where p is a prime).at n=26A138692
- a(n) = 36*n^2 - 55*n + 21.at n=17A157262
- Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=19A163393
- Odd long legs `B` of more than one primitive Pythagorean triangle.at n=15A179271
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2. These are paths that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1; an (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=51A182885
- 23 times triangular numbers.at n=30A195039