4457
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4458
- 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
- 4456
- Möbius Function
- -1
- Radical
- 4457
- 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
- 46
- 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
- 606
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=30A001134
- Balanced primes (of order one): primes which are the average of the previous prime and the following prime.at n=35A006562
- Coordination sequence for Paracelsian.at n=45A008260
- Coordination sequence for sigma-CrFe, Position Xb.at n=17A009960
- sech(sec(x)*arcsin(x))=1-1/2!*x^2-11/4!*x^4-85/6!*x^6+4457/8!*x^8...at n=4A012794
- From table of maximal epacts e(p) and corresponding primes p, for x_0=2, x_{m+1} = (x_m)^2-1; sequence gives p.at n=25A014426
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=17A020362
- 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 6.at n=15A031419
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0,3.at n=5A037689
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=29A043077
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=17A045107
- Integers n such that A047988(n)=3.at n=20A047986
- Primes p from A031924 such that A052180(primepi(p)) = 7.at n=24A052231
- Primes p such that p-6, p and p+6 are consecutive primes.at n=31A053070
- Primes p such that x^24 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=25A059331
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=23A059400
- Primes p such that x^56 = 2 has no solution mod p, but x^28 = 2 has a solution mod p.at n=30A059635
- a(n) = floor( n^e ), e = 2.718281828...at n=21A061293
- a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=6A064023
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=22A064283