4710
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 11376
- Proper Divisor Sum (Aliquot Sum)
- 6666
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1248
- Möbius Function
- 1
- Radical
- 4710
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of unreformed permutations of {1,...,n}.at n=6A007711
- Super-3 Numbers (3n^3 contains substring '333' in its decimal expansion).at n=41A014569
- a(1) = 2; a(n+1) = a(n)-th composite.at n=27A022450
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+1 or 24k-1. Also number of partitions in which no odd part is repeated, with no part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=54A036029
- Numbers k such that the string 1,0 occurs in the base 10 representation of k but not of k-1.at n=46A044342
- Numbers whose base-4 representation contains exactly three 1's and three 2's.at n=25A045103
- McKay-Thompson series of class 10c for Monster.at n=45A058204
- Triangle T(n,k) of k-block T_0-tricoverings of an n-set, n >= 3, k = 0..2*n.at n=38A059530
- Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).at n=22A060487
- Smallest multiple of n beginning with the n-th prime.at n=14A078208
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.at n=30A084142
- Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.at n=35A086583
- Largest value in trajectory of n under the juggler map of A094683.at n=43A094716
- Modified juggler map: see A095396. Largest value in trajectory of started n under the juggler map of A095396.at n=42A095397
- Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of lattice paths from (0,0) to (2n,0) consisting of steps U=(1,1), D=(1,-1), H=(2,0), never going below the x-axis (i.e., Schroeder paths) and having k UH's.at n=34A110220
- a(n) = a(n-1) + 1 + prime(n), with a(1) = 1.at n=48A110895
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 5 multiples of n-1, n-2, ..., 1, for n>=1.at n=45A113742
- Number of permutations of length n which avoid the patterns 123 and 4312.at n=17A116699
- Concatenation of 3 or more numbers in arithmetic progression with positive common difference.at n=34A119426
- Number of parts in all the compositions of n into primes (i.e., in all ordered sequences of primes having sum n).at n=18A121304