5417
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
- 2
- Divisor Sum
- 5418
- 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
- 5416
- Möbius Function
- -1
- Radical
- 5417
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- 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
- 715
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of rooted trees with n nodes and omega-valency 1.at n=12A003120
- Coordination sequence for 6-dimensional lonsdaleite.at n=7A008526
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=19A010005
- Smallest nonempty set S containing prime divisors of 9k+8 for each k in S.at n=53A020630
- Let q_k=p(p+2) be product of k-th pair of twin primes; sequence gives values of p such that (q_k)^2 > q_{k-i}q_{k+i} for all 1 <= i <= k-1.at n=36A021005
- Primes that remain prime through 2 iterations of the function f(x) = 3*x + 2.at n=47A023246
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=21A023285
- Primes which when concatenated with next 3 primes are also prime.at n=41A030472
- Primes of form x^2 + 94*y^2.at n=41A033204
- a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n+1/2.at n=41A036704
- Numbers whose base-2 representation has exactly 11 runs.at n=32A043578
- a(n) = (1/2)*(n-th number whose base-2 representation has exactly 12 runs).at n=35A043686
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=33A045107
- Sum of digits of prime p is substring of p.at n=40A052019
- Primes with distinct digits in alphabetical order (in English).at n=29A053435
- Fourth term of strong prime quintets: p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m).at n=14A054811
- Primes q of form q=10p+7, where p is also prime.at n=26A055783
- Sum of a(n) terms of 1/k^(7/8) first exceeds n.at n=16A056184
- Denoting 4 consecutive primes by p, q, r and s, these are the values of q such that q and r have 10 as a primitive root, but p and s do not.at n=42A060259
- 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 (4,2).at n=41A073649