10959
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15792
- Proper Divisor Sum (Aliquot Sum)
- 4833
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- -1
- Radical
- 10959
- Omega Function (Ω)
- 3
- 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
- 192
- 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) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.at n=11A002220
- a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=13A004949
- a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=13A004969
- 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=18A028948
- a(n) = floor(n^3 / e).at n=31A032636
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 6.at n=44A038637
- Number of optimal binary prefix-free codes with n words all ending in 1.at n=40A055167
- Partial sums of A026905; the convolution of the natural numbers with the partition function.at n=19A085360
- Least number beginning with prime(n) such that every concatenation is a prime.at n=28A090508
- Fibonacci quotients: Fibonacci(p - Legendre(p|5))/p where p runs through the primes.at n=9A092330
- Numbers of the form Fibonacci(p-1)/p, where p are primes ending in 1 or 9 (i.e., A045468).at n=2A094808
- t(n)_n where t() = triangular numbers A000217.at n=38A122634
- Rectangular table, read by antidiagonals, such that the o.g.f. of row n, R_n(y), satisfies: R_n(y) = Sum_{k>=0} y^k * R_k(y)^n for n>=0, with R_0(y) = 1/(1-y).at n=64A124460
- Row 1 of rectangular table A124460; also equals the antidiagonal sums of table A124460.at n=9A124461
- 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, 0), (-1, 0, 1), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=9A148422
- Let p = prime(n). Then a(n) = Fibonacci(p+1)/p if this is an integer, otherwise a(n) = Fibonacci(p-1)/p if this is an integer, and fall back to a(n)=0 if both are non-integer.at n=9A176951
- Values x for records of minima of the positive distance d between the seventh power of a positive integer x and the square of an integer y such that d = x^7 - y^2 (x <> k^2 and y <> k^7).at n=23A179785
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=35A180794
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=38A191397
- Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having no DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=17A191398