5477
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
- 5478
- 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
- 5476
- Möbius Function
- -1
- Radical
- 5477
- 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
- 41
- 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
- 723
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Related to population of numbers of form x^2 + y^2.at n=14A000694
- Primes of the form k^2 + 1.at n=15A002496
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=51A005529
- Coordination sequence T2 for Zeolite Code EUO.at n=46A008097
- 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=37A021005
- Initial members of prime triples (p, p+2, p+6).at n=42A022004
- Primes that remain prime through 3 iterations of function f(x) = 6x + 7.at n=7A023289
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=38A024843
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=29A027662
- [ exp(1/12)*n! ].at n=6A030937
- Smallest prime == 1 mod (n^2).at n=36A035091
- Positive numbers having the same set of digits in base 9 and base 10.at n=23A037443
- a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.at n=18A046809
- a(n)=T(n,n+1), array T as in A049723.at n=41A049729
- Primes at which the difference pattern X24Y (X and Y >= 6) occurs in A001223.at n=15A052163
- Primes of form 4*p^2 + 1, p prime.at n=5A052292
- Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.at n=35A053652
- a(n) = 4*n^2 + 1.at n=37A053755
- Totient(n) and cototient(n) are squares.at n=31A054754
- Odd powers of primes of the form q = x^2 + 1 (A002496).at n=23A054755