5189
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
- 5190
- 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
- 5188
- Möbius Function
- -1
- Radical
- 5189
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 691
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of form 3*k^2 - 3*k + 23.at n=36A007637
- Coordination sequence T6 for Zeolite Code NES.at n=46A008210
- Quadruples of different integers from [ 2,n ] with no common factors between pairs.at n=34A015628
- Primes that are palindromic in base 2 (but written here in base 10).at n=20A016041
- Numbers k such that the continued fraction for sqrt(k) has period 51.at n=6A020390
- Primes that remain prime through 2 iterations of function f(x) = 8x + 7.at n=37A023263
- Primes that remain prime through 3 iterations of function f(x) = 8x + 7.at n=2A023294
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=21A023300
- a(n) = Sum_{k=n+1..2*n} T(n,k), T given by A027052.at n=8A027077
- Palindromic primes in base 4.at n=18A029972
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 8.at n=6A031421
- Primes of form x^2+41*y^2.at n=33A033228
- State of one-dimensional cellular automaton 'sigma' (Rule 150): 000,001,010,011,100,101,110,111 -> 0,1,1,0,1,0,0,1 at generation n, converted to a decimal number.at n=6A038184
- Sums of 5 distinct powers of 4.at n=12A038473
- Numerators of continued fraction convergents to sqrt(341).at n=5A041644
- Numerators of continued fraction convergents to sqrt(424).at n=7A041806
- Numerators of continued fraction convergents to sqrt(954).at n=5A042846
- Primes with first digit 5.at n=38A045711
- Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.at n=27A048710
- a(n) = Xpower(n,3).at n=21A048732