5360
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 12648
- Proper Divisor Sum (Aliquot Sum)
- 7288
- 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
- 2112
- Möbius Function
- 0
- Radical
- 670
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- 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
- Smallest number such that n-th iterate of Chowla function is 0.at n=20A002954
- n written in fractional base 7/5.at n=28A024642
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=36A034075
- a(n) = ceiling((n + 1/2)^3).at n=16A034131
- Coordination sequence for lattice D*_4 (with edges defined by l_1 norm = 1).at n=10A035471
- Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041).at n=14A048574
- Expansion of (1-x)/(1-x-x^2-x^3+x^4).at n=18A052527
- Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling.at n=16A052837
- a(n) = |{m : multiplicative order of 4 mod m=n}|.at n=47A059886
- a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.at n=54A069203
- Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.at n=32A085690
- Number of binary trees of path length n.at n=28A095830
- In the decimal expansion of Pi, the string "0" is found at position 32 counting from the first digit after the decimal point. The string "32" is found at position 15, the string "15" at position 3, the string "3" at position 9, etc.at n=16A097614
- a(n) = 16*(8*prime(n) + 7).at n=12A098823
- Number of partitions of n having positive odd rank (the rank of a partition is the largest part minus the number of parts).at n=37A101707
- (2*7^n - 6*3^n + 4)/6.at n=5A109021
- Number of permutations of length n which avoid the patterns 312, 1324, 3421; or avoid the patterns 312, 1324, 2341, etc.at n=19A116722
- Number of partitions of n into parts with at most one part not greater than 2.at n=40A121659
- a(n) = A134207(n) + A134207(n-1).at n=39A134208
- Row sums of triangle A134237.at n=46A134238