4755
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7632
- Proper Divisor Sum (Aliquot Sum)
- 2877
- 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
- 2528
- Möbius Function
- -1
- Radical
- 4755
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 51
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^10 in powers of x.at n=12A001488
- a(n) = round(1000*log_2(n)).at n=26A004266
- a(n) = ceiling(1000*log_2(n)).at n=26A004267
- 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 21.at n=30A031519
- Number of n-node rooted trees of height at most 9.at n=12A034826
- Revert transform of x*(1 + 2*x)/(1 + 3*x + x^2).at n=20A049122
- Starting positions of strings of 2 0's in the decimal expansion of Pi.at n=34A050201
- Numbers k such that the digits of k^3 occur with the same frequency.at n=48A052047
- Numbers k such that k^3 is a cube whose digits occur with an equal minimum frequency of 2.at n=7A052051
- Number of trees with n nodes and 8 leaves.at n=7A055295
- Numbers k such that k^16 == 1 (mod 17^3).at n=14A056088
- Sum of a(n) terms of 1/k^(2/3) first exceeds n.at n=48A056178
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=34A056754
- a(n) = floor(2^n/(n^2)).at n=20A060505
- At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=21A064412
- Regard A064413 as giving a permutation of the positive integers; sequence gives second infinite cycle, beginning at its smallest term, 73.at n=42A064667
- Interprimes which are of the form s*prime, s=15.at n=24A075290
- Expansion of 1/(1 - x - 2*x^2 - 2*x^3).at n=11A077946
- Numbers n such that (2*n)!/(2*n!)+1 is prime.at n=12A091909
- Number of partitions that are "3-close" to being self-conjugate.at n=36A108962