4247
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4416
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 4080
- Möbius Function
- 1
- Radical
- 4247
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 33
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of rooted trees with n nodes, 2 of which are labeled.at n=6A000524
- a(n) = floor(1000*log_2(n)).at n=18A004265
- Coordination sequence T2 for Zeolite Code AFO.at n=43A008016
- Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=38A008295
- Crystal ball sequence for planar net 3.6.3.6.at n=43A008580
- Coordination sequence T2 for Zeolite Code VNI.at n=40A009908
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=24A015993
- a(n) is the position of square of n-th prime among the powers of primes (A000961).at n=45A024624
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=28A025212
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=3A031563
- Concatenation of n and n + 5 or {n,n+5}.at n=41A032610
- Triangle of coefficients of generating function of 6-ary rooted trees of height at most n.at n=71A036608
- Number of 6-ary rooted trees with n nodes and height at most 4.at n=16A036621
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).at n=62A036863
- Denominators of continued fraction convergents to sqrt(454).at n=8A041865
- Binary packing of Fibonacci sequence A000045.at n=6A048721
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=44A050029
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 8.at n=25A051973
- Number of orbits of length n under the map whose periodic points are counted by A001642.at n=18A060167
- Number of partitions of n objects of 2 colors with parts size >1.at n=14A060285