3141
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 4550
- Proper Divisor Sum (Aliquot Sum)
- 1409
- 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
- 2088
- Möbius Function
- 0
- Radical
- 1047
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 123
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 T6 for Zeolite Code DDR.at n=35A008076
- a(n) is the integer whose decimal digits are the first n+1 decimal digits of Pi.at n=3A011545
- Expansion of e.g.f. arcsinh(sin(x)*exp(x)).at n=7A012291
- Number of partitions of n into parts 4k+1 or 4k+2.at n=43A035365
- Numerators of continued fraction convergents to sqrt(202).at n=6A041374
- Numerators of continued fraction convergents to sqrt(746).at n=3A042436
- a(n)=(s(n)+1)/4, where s(n)=n-th base 4 palindrome that starts with 3.at n=46A043049
- Numbers n such that string 4,1 occurs in the base 10 representation of n but not of n-1.at n=34A044373
- Numbers n such that string 4,1 occurs in the base 10 representation of n but not of n+1.at n=34A044754
- Numbers whose base-5 representation contains exactly three 0's and two 1's.at n=8A045171
- Numbers whose base-5 representation contains exactly three 0's and one 3.at n=27A045200
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=60A046770
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=60A046782
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 2 mod 4.at n=41A053371
- Central column of arrays in A057027 and A057028.at n=39A057029
- Smallest integer >= 0 of the form x^4 - n^3.at n=18A070928
- Sum of first n 4-almost primes.at n=26A086046
- Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.at n=13A086667
- Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.at n=9A086667
- Numbers n such that nextprime(n^3)-prevprime(n^3) = 4.at n=23A090121