1652
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
- 12
- Divisor Sum
- 3360
- Proper Divisor Sum (Aliquot Sum)
- 1708
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 696
- Möbius Function
- 0
- Radical
- 826
- Omega Function (Ω)
- 4
- 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
- 91
- 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
- a(n) = n*(n+3)/2.at n=56A000096
- Theta series of 27-dimensional unimodular lattice with root system A_1 and a parity vector of norm 3.at n=3A002490
- Numbers that are the sum of 7 positive 6th powers.at n=18A003363
- a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.at n=15A006053
- Coordination sequence T1 for Zeolite Code DOH.at n=25A008078
- a(n) = n*(2*n + 3).at n=28A014106
- Fibonacci sequence beginning 4,9.at n=12A022130
- a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=22A025197
- a(n) = T(n,[ n/2 ] - 1), where T is the array in A026120.at n=11A026133
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=20A027419
- Number of numbers not of form k_1 k_2 .. k_n (1/k_1 + .. + 1/k_n), k_i >= 1.at n=3A027566
- Sequence satisfies T^2(a)=a, where T is defined below.at n=42A027589
- Numbers k such that 133*2^k+1 is prime.at n=14A032416
- Numbers k such that 175*2^k+1 is prime.at n=16A032464
- a(n) = 2*n*(4*n + 3).at n=14A033587
- Number of partitions of n with equal number of parts congruent to each of 2, 3 and 4 (mod 5).at n=42A035581
- Number of partitions of n into parts 4k+2 and 4k+3 with at least one part of each type.at n=51A035626
- Number of partitions of n into parts not of the form 11k, 11k+4 or 11k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=28A035947
- Number of 2-element intersecting families of an n-element set; number of 2-way interactions when 2 subsets of power set on {1..n} are chosen at random.at n=5A036239
- Number of partitions satisfying (cn(0,5) = cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=47A036824