5586
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 8094
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1512
- Möbius Function
- 0
- Radical
- 798
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 111
- 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
- Number of unlabeled identity connected unit interval graphs with n nodes.at n=13A007122
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite GOO starting with a T1 atom.at n=5A019021
- a(n) = n*(31*n-1)/2.at n=19A022288
- a(n) = 11*2^n - 4*n - 10.at n=9A051669
- Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.at n=13A053476
- Numbers k such that 2^k - 17 is prime.at n=27A059611
- Numbers k such that sigma(x) = k has exactly 7 solutions.at n=18A060663
- 3rd level triangle related to Eulerian numbers and binomial transforms (A062253 is second level, triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).at n=17A062254
- Prime(n^2) +/- n are primes.at n=17A064495
- Rounded volume of a regular dodecahedron with edge length n.at n=9A071401
- Smallest k such that gcd(c(k),k) = gcd(A002808(k),k) = A064814(k) = n.at n=37A073257
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.at n=28A075316
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.at n=36A084142
- Numbers k such that the sum of primes dividing k (with repetition) / smallest prime dividing k = largest prime dividing k.at n=35A085702
- In binary representation: numbers not occurring in their factorial.at n=35A093685
- Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.at n=20A098197
- Matrix cube of triangle A105540 and, in this flattened form as read by rows, also equals column 2 of A105540.at n=49A105545
- a(n) = (n+1)*(n+2)^2*(n+3)*(n+4)*(4*n^2+15*n+15)/720.at n=5A108682
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=21A113537
- Number of partitions p of n such that min(p) and max(p) have a common factor.at n=43A114326