3159
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5096
- Proper Divisor Sum (Aliquot Sum)
- 1937
- 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
- 1944
- Möbius Function
- 0
- Radical
- 39
- Omega Function (Ω)
- 6
- 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
- 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
- Number of trees with n unlabeled nodes.at n=14A000055
- Numbers that are the sum of 4 positive 5th powers.at n=34A003349
- Coordination sequence T2 for Zeolite Code LAU.at n=40A008125
- Coordination sequence T1 for Zeolite Code LTL.at n=41A008138
- Coordination sequence T3 for Zeolite Code MTT.at n=35A008191
- Coordination sequence T4 for Zeolite Code RTH.at n=39A009896
- a(n) = |1^3 - 2^3 + 3^3 - 4^3 + ... + (-1)^(n+1)*n^3|.at n=18A011934
- a(n) = n*(2*n + 3).at n=39A014106
- Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.at n=20A014861
- Integers k such that k divides 22^k - 1.at n=35A014959
- Odd numbers k that divide phi(k)*sigma(k).at n=9A015706
- Values of n where (phi(n) * sigma(n))/n is an integer and increases.at n=42A015707
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=12A020342
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=18A024463
- 9 times the triangular numbers A000217.at n=26A027468
- Friedman numbers: can be written in a nontrivial way using their digits and the operations + - * / ^ and concatenation of digits (but not of results).at n=44A036057
- Gaps of 10 in sequence A038593 (lower terms).at n=3A038659
- Divisible by 3 (and 9) and are differences between two cubes in at least one way.at n=33A038851
- Numbers ending with '9' that are the difference of two positive cubes.at n=14A038864
- Denominators of continued fraction convergents to sqrt(734).at n=6A042413