2483
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2688
- Proper Divisor Sum (Aliquot Sum)
- 205
- 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
- 2280
- Möbius Function
- 1
- Radical
- 2483
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of Product_{k>=1} (1 - x^k)^13.at n=15A010820
- a(n) = floor(n*(n - 1)*(n - 2)/32).at n=44A011914
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=17A011933
- Seven iterations of Reverse and Add are needed to reach a palindrome.at n=31A015986
- a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 0, a(1) = 2, a(2) = 1.at n=14A020992
- Numbers that are the sum of 4 distinct positive cubes in exactly 2 ways.at n=35A025409
- Numbers that are the sum of 4 distinct positive cubes in 2 or more ways.at n=39A025412
- Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), for k >= 5.at n=9A037140
- Partial sums of primes congruent to 1 mod 6.at n=22A038349
- Coordination sequence T7 for Zeolite Code STT.at n=33A038419
- The sequence e when b=[ 1,1,1,1,0,1,1,1,... ].at n=57A042959
- Numbers having three 5's in base 6.at n=27A043391
- Numbers whose base-7 representation has exactly 5 runs.at n=22A043620
- Numbers n such that string 5,8 occurs in the base 9 representation of n but not of n-1.at n=33A044304
- Numbers n such that string 8,3 occurs in the base 10 representation of n but not of n-1.at n=26A044415
- Numbers n such that string 3,5 occurs in the base 9 representation of n but not of n+1.at n=34A044664
- Numbers n such that string 5,8 occurs in the base 9 representation of n but not of n+1.at n=33A044685
- Numbers k such that string 8,3 occurs in the base 10 representation of k but not of k+1.at n=26A044796
- Numbers whose 4th power is the sum of two positive cubes in a nontrivial way.at n=31A051387
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 8.at n=19A051973