5097
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 6800
- Proper Divisor Sum (Aliquot Sum)
- 1703
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3396
- Möbius Function
- 1
- Radical
- 5097
- 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
- 178
- 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
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=32A007000
- Coordination sequence T3 for Zeolite Code DOH.at n=44A008080
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=16A020401
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).at n=18A024592
- 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 46.at n=32A031544
- Numbers having four 3's in base 6.at n=22A043384
- a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=38A046254
- Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).at n=24A055780
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=37A074339
- Numbers n such that googol - n is prime.at n=16A108251
- Number of equicolorable (unrooted) trees on 2n nodes.at n=7A119856
- Triangle read by rows: T(n,k) = number of unlabeled free bicolored trees with n nodes (n >= 1) and k (1 <= k <= floor(n/2), except k = 0 if n = 1 ) nodes of one color and n-k nodes of the other color (the colors are interchangeable).at n=64A122087
- a(n) = sum of numbers without digit 1 and with product of digits = n-th 7-smooth number.at n=40A130975
- a(n) = 7*n^2 + 14*n + 1.at n=26A131878
- a(1)=1. a(n) = a(n-1) + (sum of the distinct primes that are <= n and don't divide a(n-1)).at n=47A137395
- Numbers of the form 56+p^2 (where p is a prime).at n=19A138690
- 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, 0), (0, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A148933
- Indices of 4's in A090822.at n=22A157107
- A recursion triangle sequence based on the Eulerian numbers: A(n,k)=n*A(n-1,k-1)+k*Eulerian(n-1,k).at n=21A157743
- a(n) = 392*n + 1.at n=13A158002