10497
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14000
- Proper Divisor Sum (Aliquot Sum)
- 3503
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6996
- Möbius Function
- 1
- Radical
- 10497
- Omega Function (Ω)
- 2
- 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
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 94.at n=27A020433
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=33A024848
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 68.at n=28A031566
- Sort then Add, a(1)=15.at n=15A033898
- Sort then Add, a(1)=21.at n=14A033901
- Expansion of sum ( q^n / product( 1-q^k, k=1..4*n), n=0..inf ).at n=28A035296
- a(n) = 6*a(n-1) - a(n-2), n >= 2, a(0)=1, a(1)=9.at n=5A038761
- a(n) = 2*a(n-1) + a(n-2); a(0)=1, a(1)=4.at n=10A048654
- 2*a(n)^2 + 7 is a square.at n=10A077442
- Pascal-(1,3,1) array.at n=59A081578
- Pascal-(1,3,1) array.at n=61A081578
- Start with the sequence S(0)={1,1} and for k>0 define S(k) to be I(S(k-1)) where I denotes the operation of inserting, for i=1,2,3..., the term a(i)+a(i+1) between any two terms for which 4a(i+1)<=5a(i). The listed terms are the initial terms of the limit of this process as k goes to infinity.at n=20A082981
- Semiprimes (A001358) whose digit reversal is a triangular number.at n=33A115741
- a(n) = 104*n + 9977.at n=5A126978
- a(2n) = A001542(n+1), a(2n+1) = A038761(n+1); a Pellian-related sequence.at n=9A129345
- Record indices of A135727(n) = max{ A001281^k(n);k=0,1,2,3... } (3x-1 problem).at n=18A135728
- Record indices of A135727(n)/n = max{ A001281^k(n);k=0,1,2,3... }/n (3x-1 problem).at n=11A135729
- Result of using the primes as coefficients in an infinite polynomial series in x and then expressing this series as (1+a(1)x)(1+a(2)x^2)(1+a(3)x^3)...at n=15A147557
- a(n) = 256*n + 1.at n=40A158231
- 6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes.at n=27A178145