10971
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16848
- Proper Divisor Sum (Aliquot Sum)
- 5877
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6864
- Möbius Function
- 0
- Radical
- 3657
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 267
- 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
- In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1.at n=26A006877
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=27A015994
- a(n) = F(n+2) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or is a non-Fibonacci number.at n=18A022800
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=28A023109
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Fibonacci number).at n=17A023486
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Lucas number).at n=18A023491
- Least number of Reverse-then-add persistence n.at n=28A033866
- In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1.at n=20A033958
- Decimal part of a(n)^(1/3) starts with reversal of its integer part: first term of runs.at n=20A034309
- Expansion of 1/(1-x+2*x^2-x^3) in powers of x.at n=37A077954
- n sets a record for the number of primes in {n, f(n), f(f(n)), ..., 1}, where f is the Collatz function defined by f(x) = x/2 if x is even; f(x) = 3x + 1 if x is odd.at n=13A078373
- Expansion of 1/(1 + 2*x + 3*x^2 + x^3).at n=24A127896
- Maximal number of right triangles in n turns of Pythagoras's snail.at n=32A137515
- The smallest positive integer that produces exactly n primes in a Collatz trajectory.at n=43A181921
- Number of 5-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first and second differences in -n..n.at n=18A209009
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having one, two or three distinct values for every i<=n and j<=n.at n=6A211501
- Number of idempotent 3X3 -n..n matrices of rank 1.at n=8A221312
- Expansion of Product_{k>=0} 1/(1 - x^(3*k+1))^2.at n=38A261616
- p-INVERT of the squares (A000290), where p(S) = 1 - S^3.at n=8A292532
- Composite numbers k such that A006577(k) sets a new record.at n=21A346591