7963
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7964
- 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
- 7962
- Möbius Function
- -1
- Radical
- 7963
- 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
- 251
- 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
- 1006
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- 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 89.at n=4A031587
- Number of binary rooted trees with n nodes and height exactly 7.at n=17A036596
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=2A045277
- Discriminants of imaginary quadratic fields with class number 13 (negated).at n=25A046010
- Primes whose consecutive digits differ by 2 or 3.at n=42A048414
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=25A050666
- a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=46A074344
- Iccanartet sequence: a(n)=R[a(n-1)]+R[a(n-2)]+R[a(n-3)]+R[a(n-4)] where a(1)=a(2)=a(3)=a(4)=1 and R(n) (A004086) is the reverse of n.at n=12A074862
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=20A082888
- Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=4A084277
- Primes p such that 6p + 1 and (p-1)/6 are primes.at n=16A085957
- Primes in which the digit string can be partitioned into three parts such that third (least significant) part is the product of the first two.at n=4A088294
- Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.at n=20A094932
- Primes with digit sum = 25.at n=40A106763
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 10.at n=14A109564
- Smallest prime p=prime(k) such that there exist numbers i and j with prime(k-1) < i < p < j < prime(k+1) and gcd(i,j)=n.at n=34A117392
- Numbers appearing in A122072 at least three times.at n=29A122384
- Least k such that the Collatz (3x+1) iteration starting with k has "dropping time" A122437(n).at n=45A122442
- Primes p such that q-p = 30, where q is the next prime after p.at n=8A124596
- Primes with prime "Look And Say" descriptions from right to left (irrespective of method A or method B).at n=21A127179