2573
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2688
- Proper Divisor Sum (Aliquot Sum)
- 115
- 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
- 2460
- Möbius Function
- 1
- Radical
- 2573
- 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
- 27
- 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
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=39A001836
- Number of partitions of n that do not contain 1 as a part.at n=35A002865
- Numbers that are the sum of 6 positive 7th powers.at n=10A003373
- Numbers that are the sum of at most 6 positive 7th powers.at n=45A004868
- Numbers k such that (2^(2k+1) - 2^(k+1) + 1)/5 is prime.at n=12A006596
- Coordination sequence T1 for Zeolite Code AFI.at n=35A008014
- Coordination sequence T2 for Zeolite Code BOG.at n=36A008050
- Seven iterations of Reverse and Add are needed to reach a palindrome.at n=32A015986
- Pisot sequence L(4,10).at n=7A020734
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531.at n=12A024313
- a(n) is the number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=2; also a(n) = T(2n,n-1).at n=5A026388
- Convolution of Thue-Morse sequence A001285 with primes.at n=30A029888
- Positions of record values in A030767.at n=51A030772
- Coordination sequence T4 for Zeolite Code AFN.at n=36A038404
- Numerators of continued fraction convergents to sqrt(492).at n=4A041938
- Numbers having three 5's in base 6.at n=32A043391
- Numbers n such that string 1,5 occurs in the base 8 representation of n but not of n-1.at n=45A044200
- Numbers k such that the string 6,8 occurs in the base 9 representation of k but not of k-1.at n=34A044313
- Numbers n such that string 7,3 occurs in the base 10 representation of n but not of n-1.at n=27A044405
- Numbers k such that string 1,5 occurs in the base 8 representation of k but not of k+1.at n=45A044581