4919
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4920
- 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
- 4918
- Möbius Function
- -1
- Radical
- 4919
- 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
- 103
- 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
- yes
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 657
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of form 2n^2 - 2n + 19.at n=37A007639
- Coordination sequence T1 for Zeolite Code MON.at n=43A008181
- a(n) = floor(n*(n - 1)*(n - 2)/32).at n=55A011914
- Next prime after n^3.at n=17A014220
- Primes that remain prime through 2 iterations of the function f(x) = 3*x + 2.at n=44A023246
- Primes that remain prime through 2 iterations of function f(x) = 8x + 7.at n=34A023263
- Primes that remain prime through 3 iterations of function f(x) = 7x + 6.at n=9A023290
- Primes that remain prime through 4 iterations of function f(x) = 7x + 6.at n=3A023318
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=13A025025
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=26A025193
- 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 69.at n=14A031567
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a prime.at n=41A032695
- Zeroless primes that remain prime if any digit is deleted.at n=20A034302
- a(n) is the smallest prime such that a(1), ..., a(n-1) are squares mod a(n).at n=7A034698
- a(n) is square mod a(i), i < n.at n=14A034791
- Numbers having three 6's in base 9.at n=23A043479
- Primes p such that pp'-2 is prime, where p' denotes the next prime after p.at n=27A048797
- Primes remaining prime if any digit is deleted (zeros allowed).at n=24A051362
- Primes p with the following property: let d_1, d_2, ... be the distinct digits occurring in the decimal expansion of p. Then for each d_i, dropping all the digits d_i from p produces a prime number. Leading 0's are not allowed.at n=32A057876
- Primes with 3 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of any one of its distinct digits.at n=23A057879