7583
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7584
- 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
- 7582
- Möbius Function
- -1
- Radical
- 7583
- 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
- 83
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 963
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 39*2^k + 1 is prime.at n=33A002269
- Primes of form 2n^2 - 2n + 19.at n=43A007639
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=19A010011
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=28A020411
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=36A023866
- Number of sums S of distinct positive integers satisfying S <= n.at n=38A026906
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m = floor((n+2)/2), T given by A027948.at n=12A027958
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 87.at n=1A031585
- Primes that are concatenations of n with n + 8.at n=9A032631
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.at n=41A049438
- Primes p that have exactly two primitive roots that are not primitive roots mod p^2.at n=37A060518
- Primes p for which the exponent of the highest power of 2 dividing p! is equal to prevprime(prevprime(p)).at n=33A064396
- Primes of the form floor((6/5)^k).at n=9A067907
- Smallest prime factor of googol - n that exceeds 13, or 1 if googol - n is 13-smooth.at n=6A078813
- Smallest primes such that a(j) - a(k) are all different.at n=41A079848
- a(n) = floor(6^n/5^n).at n=49A094983
- Balanced primes of order five.at n=21A096697
- Balanced primes (A090403) of index 2.at n=38A096706
- Prime numbers p such that pi(p) + 2*p is a square.at n=12A104783
- Triangle read by rows: row n (n>=2) gives a set of n primes such that the pairwise averages are all distinct primes, having the smallest largest element.at n=51A115631