4723
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
- 4724
- 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
- 4722
- Möbius Function
- -1
- Radical
- 4723
- 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
- 59
- 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
- 637
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Indices of prime Fibonacci numbers.at n=22A001605
- Total number of fixed points in rooted trees with n nodes.at n=9A005200
- Primes of form 2n^2 - 2n + 19.at n=36A007639
- Numbers k such that the continued fraction for sqrt(k) has period 82.at n=7A020421
- 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 67.at n=22A031565
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 34 ones.at n=22A031802
- Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k.at n=33A033548
- Decimal part of n-th root of a(n) starts with digit 6.at n=16A034083
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=64A036865
- Discriminants of imaginary quadratic fields with class number 9 (negated).at n=22A046006
- Integers n such that A047988(n)=3.at n=22A047986
- a(n)=T(n,n+3), array T as in A049723.at n=37A049731
- Primes p from A031924 such that A052180(primepi(p)) = 29.at n=4A052236
- Least prime in A031924 (lesser of 6-twins) such that the distance to the next 6-twin is 2*n.at n=32A052352
- Number of positive integers <= 2^n of form x^2 + 13 y^2.at n=15A054227
- Primes with 2 representations: p*q*r - 1 = u*v*w + 1 where p, q, r, u, v and w are primes.at n=19A063644
- a(n) = p.q in decimal notation where p = prime(n) and q is the smallest prime (A066065(n)) such that the concatenation p.q is a prime.at n=14A066064
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (2,6).at n=27A073650
- p, p+6 and p+10 are consecutive primes.at n=31A078562
- Primes p such that both p-1 and p+1 have at most 3 prime factors, counted with multiplicity; i.e., primes p such that bigomega(p-1) <= 3 and bigomega(p+1) <= 3, where bigomega(n) = A001222(n).at n=25A079153