3953
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4080
- Proper Divisor Sum (Aliquot Sum)
- 127
- 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
- 3828
- Möbius Function
- 1
- Radical
- 3953
- 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
- 51
- 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
- Coordination sequence T3 for Zeolite Code MTW.at n=41A008198
- Convolution of primes with themselves.at n=14A014342
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=34A023180
- 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=28A024836
- a(n) = 2^n - n^2 + 1.at n=12A030110
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=19A032701
- Number of n-node rooted unlabeled trees with exactly 3 edges at root and otherwise out-degree <= 2.at n=15A036658
- Numbers whose base-5 representation contains exactly three 1's and two 3's.at n=21A045246
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=13A056132
- Integer part of log(n!)^(1 + log(1 + log(1 + n))).at n=17A062445
- Nearest integer to log(n!)^(1 + log(1 + log(1 + n))).at n=17A062446
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 71 ).at n=19A063344
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=22A064906
- Numbers n such that the sum of composites from the smallest prime factor of n to the largest prime factor of n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.at n=2A074255
- a(n) = 4^n + 6^n + 7^n.at n=4A074565
- Expansion of (1-x)^(-1)/(1-x+x^3).at n=56A077869
- 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,3}.at n=24A079965
- a(n) = prime(n)*prime(n+2).at n=16A090076
- Number of one-bit dominant primes (A095070) in range ]2^n,2^(n+1)].at n=15A095020
- Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].at n=15A095054