5562
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12480
- Proper Divisor Sum (Aliquot Sum)
- 6918
- 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
- 1836
- Möbius Function
- 0
- Radical
- 618
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=34A000338
- Coordination sequence T3 for Zeolite Code EUO.at n=46A008098
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=15A037260
- Numbers k such that x-4, x-2, x+2, x+4 are primes, where x = 30*k - 15.at n=46A061668
- Integer part of (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=35A062482
- Larger terms of the pairs (a < b) in the sequence {a,b}-> {Max[{a,b}]-Min[{a,b}],k*Min[{a,b}]} with k=3 and the first pair {a=1,b=2}. See A075256.at n=35A075258
- Subminimal numbers, from minimal numbers by analogy with subfactorials.at n=41A079717
- Number of partitions of n into numbers having in binary representation at most trailing zeros.at n=36A087750
- Numbers k such that 10^k+9^(k-1) is prime.at n=18A096186
- Least positive k such that k*n + 1 is a golden semiprime (A108540).at n=50A108200
- Sum of NumberOfParts!/NumberOfDifferentParts! for all integer partitions of n.at n=7A108492
- Lengths of k-cycles (k > 1) of permutation A114650 in order of their first appearance.at n=18A112664
- Non-cubefree numbers k such that 2k+1 is also non-cubefree (A046099).at n=38A115170
- Number of fused bicyclic skeletons with n carbon atoms (see Parks et al. for precise definition).at n=8A121327
- Numbers k such that A120292(k) is composite.at n=30A141779
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=17A162705
- Number of binary strings of length n with equal numbers of 00001 and 01000 substrings.at n=13A164197
- Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 + x5*x6 = n, with all xi >= 1.at n=43A191832
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=11A193006
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four or six distinct values for every i,j,k<=n.at n=6A211575