1562
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2592
- Proper Divisor Sum (Aliquot Sum)
- 1030
- 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
- 700
- Möbius Function
- -1
- Radical
- 1562
- 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
- 122
- 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
- yes
- Odd
- no
Appears in sequences
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=21A000125
- Numbers of the form (p^2 - 49)/120 where p is prime.at n=41A002382
- Number of (undirected) Hamiltonian paths in the n-ladder graph K_2 X P_n.at n=39A003682
- Number of partitions of n into 3 or more parts.at n=23A004250
- Coordination sequence T5 for Zeolite Code HEU.at n=26A008120
- Coordination sequence T4 for Zeolite Code RUT.at n=26A009900
- Number of edge-disjoint paths between opposite corners of a 2 X n grid.at n=6A013991
- Number of edge-disjoint paths between opposite corners of 5xn grid.at n=3A013994
- a(n) = n^2 + n + 2.at n=39A014206
- Number of (unordered) triples of integers from [1,n] with no common factors between pairs.at n=30A015617
- Number of 5-tuples of different integers from [ 2,n ] with no common factors among pairs.at n=23A015699
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=23A015728
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=46A017863
- Population of "Triangle" cellular automaton at n-th generation.at n=22A018189
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T1 atom.at n=10A019158
- Pseudoprimes to base 45.at n=15A020173
- Positive numbers k such that k and 3*k are anagrams in base 8 (written in base 8).at n=1A023074
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=21A024312
- a(n) = least m such that if r and s in {h/(1 + h^2): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k.at n=44A024828
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=20A024875