10775
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
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 2617
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8600
- Möbius Function
- 0
- Radical
- 2155
- 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
- 148
- 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
- a(n) = Sum_{k=0..floor(n/2)} T(n-k, k), T given by A026692.at n=18A026702
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=35A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=35A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=35A050068
- The sixth column of triangle A091492, excluding leading zeros.at n=49A091498
- Positive integers i for which A112049(i) == 7.at n=26A112067
- 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, 0, 1), (0, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=8A149278
- Volume of torus (rounded down) with major radius = n and minor radius = n/3.at n=16A228641
- a(n) = ceiling(n^3*(Pi/2)).at n=18A248198
- If n is 0, 1, or prime, a(n) = n; else a(n) = a(n-1) + a(n-2).at n=38A265822
- Sum of the sixth largest parts in the partitions of n into 8 parts.at n=42A308992
- Number of multisets of exactly ten partitions of positive integers into distinct parts with total sum of parts equal to n.at n=17A320795
- Numbers k such that A109812(k) AND A109812(k+2) = 0 (where AND denotes the bitwise AND operator).at n=29A352773
- Consecutive states of the linear congruential pseudo-random number generator (430*s + 2531) mod 11979 when started at s=1.at n=38A384431