4267
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4536
- Proper Divisor Sum (Aliquot Sum)
- 269
- 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
- 4000
- Möbius Function
- 1
- Radical
- 4267
- 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
- 126
- 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
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=23A003294
- Coordination sequence T5 for Zeolite Code CON.at n=46A009872
- Coordination sequence T7 for Zeolite Code CON.at n=46A009874
- Number of triples (i,j,k) with 1 <= i < j < k <= n and gcd(i,j,k) = 1.at n=31A015616
- a(n) = floor( a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ), for n >= 3 with a(1) = 1 and a(2) = 3.at n=30A022877
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=29A024836
- Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).at n=34A025064
- Numerator of Sum_{k=1..n} 1/phi(k).at n=20A028415
- Numbers with exactly five distinct base-8 digits.at n=8A031985
- Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".at n=14A035932
- Number of binary rooted trees with n nodes and height exactly 7.at n=16A036596
- Expansion of (3+2*x^2)/(1-x)^4.at n=16A037236
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=7A039664
- Denominators of continued fraction convergents to sqrt(872).at n=9A042685
- Initial n digits in decimal portion of golden ratio phi = (1 + sqrt 5)/2 form a prime number.at n=3A065868
- Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1.at n=39A072524
- Number of planar partitions of n with exactly 3 rows.at n=14A091357
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and is divisible by (k-1), that is A065395(k)/(k-1) = (phi(sigma(k))-sigma(phi(k)))/(k-1) is a nonzero integer.at n=8A092585
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LR] (when read digit-by-digit).at n=48A093102
- Continued fraction expansion of fourth root of 9.1.at n=33A093876