4357
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4358
- 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
- 4356
- Möbius Function
- -1
- Radical
- 4357
- 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
- 595
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of positive integers <= 2^n of form x^2 + y^2.at n=14A000050
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=42A000945
- Primes of the form k^2 + 1.at n=14A002496
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=47A005529
- Number of sensed 2-connected simple planar maps with n edges.at n=9A006406
- From relations between Siegel theta series.at n=53A006476
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=20A007419
- Coordination sequence T5 for Zeolite Code MTW.at n=43A008200
- a(n) = prime(n*(n+1)/2).at n=33A011756
- a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.at n=37A024825
- Squarefree n such that Q(sqrt(n)) has class number 5.at n=31A029705
- Primes of form x^2+83*y^2.at n=31A033253
- Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k.at n=30A033548
- Primes p such that (p+1)/2 and (p+2)/3 are also primes.at n=12A036570
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=14A037260
- Sums of 4 distinct powers of 4.at n=19A038472
- Smallest k for which k, 2k, ... nk all contain the digit 7.at n=4A039938
- Numbers having, in base 16, (sum of even run lengths)=(sum of odd run lengths).at n=34A044887
- Numbers whose base-4 representation contains exactly three 0's and four 1's.at n=4A045032
- Primes whose consecutive digits differ by 1 or 2.at n=42A048413