4910
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8856
- Proper Divisor Sum (Aliquot Sum)
- 3946
- 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
- 1960
- Möbius Function
- -1
- Radical
- 4910
- 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
- 134
- 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
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite CLO = Cloverite starting with a T1 atom.at n=5A019003
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 14.at n=9A031692
- Cycle of 2 steps possible for 'concatenate a(n) and nextprime(a(n)) is a prime'.at n=34A034592
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(2) = 4.at n=28A050039
- Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.at n=32A052276
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=21A059954
- Least number k such that floor( k / digit reversal of k ) = n.at n=24A068779
- Numbers k such that (-k!! + (k+1)!! + 1)/2 is prime.at n=12A076210
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2}.at n=27A079966
- Main diagonal of A082228.at n=35A082231
- a(n) = floor(2^n*log(n)).at n=10A094939
- Number of partitions of n into parts each of which is used a different number of times.at n=42A098859
- Number of permutations of length n which avoid the patterns 1423, 3421.at n=7A116710
- Maximum number of unit squares aligned with unit-spaced horizontal lines that can be enclosed by a circle of radius n.at n=40A124484
- Poincaré series [or Poincare series] P(C^o_{5,2}; x).at n=7A124635
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A148857
- One fourth of the alternating sum of the squares of the first n Fibonacci numbers with index divisible by 3.at n=4A156091
- a(n) = 196*n^2 + 2*n.at n=4A158222
- a(n) = 100*n^2 + 10.at n=7A158492
- Composite numbers such that exactly nine distinct permutations of digits give primes.at n=40A163561