1471
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1472
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1470
- Möbius Function
- -1
- Radical
- 1471
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 171
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 233
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes.at n=14A000127
- Number of monosubstituted alkanes C(n-1)H(2n-1)-X with n-1 carbon atoms that are not stereoisomers.at n=16A000621
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=21A000923
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=42A000960
- Primes with 6 as smallest primitive root.at n=15A001125
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=10A001136
- Numbers divisible only by primes congruent to 1 mod 7.at n=39A004619
- Prime-indexed primes: primes with prime subscripts.at n=50A006450
- Place n equally-spaced points around a circle and join every pair of points by a chord; this divides the circle into a(n) regions.at n=14A006533
- Number of n-node forests not determined by their spectra.at n=12A006611
- Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).at n=23A007979
- Coordination sequence T2 for Zeolite Code AFR.at n=29A008020
- Coordination sequence T1 for Zeolite Code EAB.at n=28A008082
- Expansion of (1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=46A008769
- Coordination sequence T3 for Zeolite Code -CLO.at n=34A009852
- Super-3 Numbers (3n^3 contains substring '333' in its decimal expansion).at n=8A014569
- Primes of the form x^2 + 27y^2.at n=32A014752
- Numbers k=3*m+1 such that 2^m == 1 (mod k).at n=33A016108
- Coordination sequence T3 for Zeolite Code SAO.at n=30A019573
- Numbers k such that the continued fraction for sqrt(k) has period 64.at n=1A020403