10548
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
- 18
- Divisor Sum
- 26754
- Proper Divisor Sum (Aliquot Sum)
- 16206
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3504
- Möbius Function
- 0
- Radical
- 1758
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=29A015994
- 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=30A023109
- Least number of Reverse-then-add persistence n.at n=30A033866
- Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.at n=21A053093
- Indices of record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.at n=7A065198
- 30 'Reverse and Add' steps are needed to reach a palindrome.at n=0A065319
- Indices of primes occurring in A030284.at n=32A107365
- Number of bipartite planar graphs with 2n nodes and exactly one zero eigenvector.at n=9A133237
- Triangle read by rows: T(n, k) is the coefficient of x^k in the polynomial 1 - T_n(x)^2, where T_n(x) is the n-th Hermite polynomial of the Hochstadt kind (A137286) as related to the generalized Chebyshev in a Shabat way (A123583): p(x,n)=x*p(x,n-1)-p(x,n-2); q(x,n)=1-p(x,n)^2.at n=57A136667
- a(n) = n*(8*n+5).at n=36A139277
- Number of primes p less than 10^n such that p^2-2 is prime.at n=5A140454
- Triangle T(n, k) = n!*Sum_{j=k..n} (-1)^(j+k)*binomial(k+j, j)/j!, read by rows.at n=32A156984
- Partial sums of A160410.at n=21A160799
- Omit the initial 1 from A000141 and take the Mobius transform.at n=22A190622
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,3,0,4 for x=0,1,2,3,4.at n=5A196691
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,3,0,4 for x=0,1,2,3,4.at n=2A196694
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,1,3,0,4 for x=0,1,2,3,4.at n=30A196696
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,1,3,0,4 for x=0,1,2,3,4.at n=33A196696
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,4,0,3 for x=0,1,2,3,4.at n=2A196727
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,1,4,0,3 for x=0,1,2,3,4.at n=30A196729