5497
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 263
- 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
- 5236
- Möbius Function
- 1
- Radical
- 5497
- 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
- 98
- 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
- Shifts one place left under 6th-order binomial transform.at n=5A005012
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=29A028948
- [ exp(2/23)*n! ].at n=6A030827
- a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=28A033500
- Denominators of continued fraction convergents to sqrt(935).at n=10A042809
- Numbers having three 7's in base 9.at n=11A043483
- Bessel function |J_0(n)| is a monotonically decreasing positive sequence.at n=30A046962
- Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).at n=22A053592
- Triangle T(n,k) giving number of 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).at n=72A059683
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=27A064907
- Number of solutions to x^2 + y^2 + z^2 < n^2; number of lattice points inside a sphere of radius n.at n=11A078183
- a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7)+a(n-8).at n=23A109539
- Numbers such that the sum of the digits of floor(phi^n) is also the sum of the digits of the n-th Fibonacci number (in base 10), where phi is the golden ratio.at n=44A111366
- Triangle, generated from A111579.at n=72A111673
- Number of partitions of n such that number of parts is equal to the sum of parts counted without multiplicities.at n=57A114638
- Ramanujan numbers (A000594) read mod 23^3.at n=21A126847
- Triangle read by rows: A001263 * A128064 * A000012 as infinite lower triangular matrices.at n=38A136536
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0100-1111-0100 pattern in any orientation.at n=15A146377
- 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, 0), (-1, -1, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A148956
- Zero-less composite numbers such that exactly eight distinct anagrams are primes.at n=33A163651