10985
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14280
- Proper Divisor Sum (Aliquot Sum)
- 3295
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8112
- Möbius Function
- 0
- Radical
- 65
- Omega Function (Ω)
- 4
- 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
- 161
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=30A020368
- a(n) = Sum_{k=0..n} (k+1) * A026758(n, n-k).at n=10A027236
- Sets of 4 consecutive numbers with equal number of divisors.at n=34A039665
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=40A049750
- Numbers n such that 295*2^n-1 is prime.at n=18A050906
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n.at n=21A057288
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=29A063048
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=38A064975
- Numbers k such that 2^k + 3^(k-1) is prime.at n=45A082400
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=30A088753
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=19A097225
- Composite numbers whose exponents in their canonical factorization lie in the geometric progression 1, 3, 9, ...at n=13A102838
- Numbers of the form (5^i)*(13^j).at n=15A107466
- Positions of 4's in A038800 with offset 1.at n=39A115095
- 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, -1, 0), (-1, 0, 0), (0, 1, -1), (1, 0, 1)}.at n=9A148772
- Similar to A072921 but starting with 4.at n=42A152233
- a(n) = 65*n^2.at n=12A165798
- Numbers n with property that the largest proper divisor of n is a cube.at n=28A187104
- Triangle read by rows: T(n,k) is the number of secondary structures of size n having k stacks of length 3.at n=45A202843
- T(n,k)=Rolling icosahedron footprints: number of nXk 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an icosahedral edge.at n=13A223233