10975
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13640
- Proper Divisor Sum (Aliquot Sum)
- 2665
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8760
- Möbius Function
- 0
- Radical
- 2195
- Omega Function (Ω)
- 3
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=23A028948
- Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.at n=9A052818
- Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.at n=11A056156
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=28A076425
- floor((log(4)/log(3))^n).at n=40A140881
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1000-1111-0100-0100 pattern in any orientation.at n=16A146827
- a(n) = 392*n - 1.at n=27A158004
- a(n) = 784*n - 1.at n=13A158399
- a(n) = 14*n^2 - 1.at n=27A158485
- a(n) = 56*n^2 - 1.at n=13A158658
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=34A165463
- a(n) = n*prime(prime(n)) - prime(n).at n=23A230285
- Number of disconnected simple non-chordal graphs on n vertices.at n=8A287482
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) - b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=21A295362
- Number of integer partitions of n whose distinct parts are connected.at n=53A304716
- Bases in which 7 is a unique-period prime.at n=37A306075
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=8A316423
- Number of compositions of n into distinct parts such that the difference between adjacent parts is at least two.at n=29A328222
- Starts of runs of 3 consecutive positive negaFibonacci-Niven numbers (A331085).at n=33A331087
- Inverse Moebius transform of A000056.at n=23A350156