1935
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
- 3432
- Proper Divisor Sum (Aliquot Sum)
- 1497
- 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
- 1008
- Möbius Function
- 0
- Radical
- 645
- Omega Function (Ω)
- 4
- 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
- 143
- Smith Number
- yes
- 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
- a(n) = 4*n^2 - 1.at n=22A000466
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=16A001209
- Number of solutions to a linear inequality.at n=39A002797
- a(n) = n*(n+2) = (n+1)^2 - 1.at n=43A005563
- Number of walks on cubic lattice.at n=14A005570
- a(n) = a(n-1) + a(n-2) + a(n-3).at n=12A007486
- Coordination sequence T1 for Zeolite Code NES.at n=28A008205
- Expansion of (1+x^9)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=51A008770
- Coordination sequence T3 for Zeolite Code RSN.at n=29A009887
- Coordination sequence T3 for Zeolite Code RUT.at n=29A009899
- Pseudoprimes to base 44.at n=21A020172
- Base 6 expansion uses each positive digit just once.at n=5A023744
- Number of partitions satisfying (cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=32A036802
- Digit sum of composite odd number equals digit sum of juxtaposition of its prime factors (counted with multiplicity).at n=33A036925
- Numbers which are one less than a perfect square that cannot otherwise be written as a power.at n=34A037450
- Coordination sequence T5 for Zeolite Code STT.at n=29A038415
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=28A039894
- Denominators of continued fraction convergents to sqrt(483).at n=5A041923
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 0.at n=16A042980
- Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.at n=16A042981