1483
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1484
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1482
- Möbius Function
- -1
- Radical
- 1483
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 140
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 235
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of g.f. Product_{k >= 1} (1 - x^k)^(-k*(k+1)/2).at n=9A000294
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=22A000923
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=43A000960
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=44A001000
- Associated Mersenne numbers.at n=19A001351
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=39A002061
- Primes of form k^2 + k + 1.at n=15A002383
- Divisible only by primes congruent to 6 mod 7.at n=42A004624
- From relations between Siegel theta series.at n=9A006476
- Greater of twin primes.at n=48A006512
- Crystal ball sequence for hexagonal close-packing.at n=7A007202
- Primes of form x^3 + y^3 + z^3 where x,y,z > 0.at n=37A007490
- Prime triples: p; p+2 or p+4; p+6 all prime.at n=39A007529
- Coordination sequence T3 for Zeolite Code EUO.at n=24A008098
- Expansion of (1+x^10)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=47A008771
- Least m such that if a/b < c/d are Farey fractions of order n then there exists k such that a/b < k/m < c/d, k/m reduced.at n=44A009571
- Coordination sequence T4 for Zeolite Code ZON.at n=27A009922
- Continued fraction for zeta(9).at n=78A013685
- Number of 8's in all the partitions of n into distinct parts.at n=52A015743
- Number of partitions of n into distinct parts, none being 8.at n=45A015755