5795
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7440
- Proper Divisor Sum (Aliquot Sum)
- 1645
- 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
- 4320
- Möbius Function
- -1
- Radical
- 5795
- Omega Function (Ω)
- 3
- 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
- 142
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = floor(n*phi^12), where phi is the golden ratio, A001622.at n=18A004927
- Number of permutations of [n] with four inversions.at n=15A005287
- Indices of prime Cullen numbers: numbers k such that k*2^k + 1 is prime.at n=3A005849
- Coordination sequence T3 for Zeolite Code MFS.at n=47A008175
- Expansion of (1-x^5) / (1-x)^5.at n=19A008487
- a(n) = Sum_{k=1..n} floor((n/k) * floor((n/k) * floor(n/k))).at n=16A024922
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=20A026101
- Numbers having period-2 6-digitized sequences.at n=15A031357
- Least term in period of continued fraction for sqrt(n) is 8.at n=20A031432
- a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct.at n=19A036241
- a(n) is the integer part of the geometric mean of n! and n^n.at n=6A062871
- Numbers beginning and ending with their multiplicative digital root.at n=30A064704
- Smallest of four consecutive integers divisible by four consecutive primes respectively.at n=34A072555
- Expansion of Molien series for a certain 4-D group of order 48.at n=46A078411
- Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.at n=17A083930
- Non-palindromic solutions to sigma(R(n)) = sigma(n), where R = A004086 is digit-reversal.at n=7A085329
- Diagonal sums of a matrix associated to the inverse of a Catalan scaled binomial matrix.at n=9A098511
- Number of unlabeled graphs with n nodes and an invertible adjacency matrix.at n=7A109717
- Positive integers i for which A112049(i) == 6.at n=36A112066
- Start with 1 and repeatedly reverse the digits and add 74 to get the next term.at n=8A118225