10964
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19194
- Proper Divisor Sum (Aliquot Sum)
- 8230
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5480
- Möbius Function
- 0
- Radical
- 5482
- 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
- 130
- 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
- Denominators of continued fraction convergents to sqrt(512).at n=9A041979
- a(n) = ceiling(binomial(n,6)/n).at n=26A053643
- Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.at n=45A069831
- Number of essentially different permutations of the numbers 1 to n such that the sum of adjacent numbers is a square.at n=23A090460
- Number of partitions of n with rank 1 (the rank of a partition is the largest part minus the number of parts).at n=50A101198
- Starting from a(1)=2, a(n) = A028260(1+a(n-1)) if n is even, a(n) = A026424(a(n-1)) if n is odd.at n=12A160966
- 3^n times the expected value of the longest run of 0's in all length n words on {0,1,2}.at n=8A209241
- Number of 2 X 2 matrices having all terms in {-n,...,0,..,n} and permanent=trace.at n=33A211145
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant > n.at n=5A211151
- Number of distinct values of the sum of 2 products of three 0..n integers.at n=19A225259
- Floor(1/s(n)), where s(n) = (2n+1)/(2n+2) - n*log((n+1)/n).at n=41A227721
- Numbers k such that A084937(3k) > A084937(3k+1).at n=27A249689
- Partial sums of A252750: a(0) = 0; for >= 1: a(n) = A252750(n) + a(n-1).at n=60A252751
- Number of n-bit legal binary words with maximal set of 1s.at n=28A253412
- Expansion of f(x^2)^2 / f(-x) in powers of x where f() is a Ramanujan theta function.at n=33A260163
- Numbers k such that 49^k - 7^k - 1 is prime.at n=6A265485
- Numbers k such that (7*10^k + 53)/3 is prime.at n=16A293683
- Number of integer partitions of n such that every set of distinct parts has a different sum.at n=43A325862
- Numbers that are the sum of nine fourth powers in eight or more ways.at n=39A345592
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=7A345593