1147
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
- 4
- Divisor Sum
- 1216
- Proper Divisor Sum (Aliquot Sum)
- 69
- 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
- 1080
- Möbius Function
- 1
- Radical
- 1147
- 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
- 57
- 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
- a(n) = ceiling(1000*log_10(n)).at n=13A004227
- a(n) = (F(2n+1) + F(2n-1) + F(n+3) - 2)/2, where F() = Fibonacci numbers A000045.at n=7A005593
- Products of 2 successive primes.at n=10A006094
- Composite but smallest prime factor >= 17.at n=34A008367
- Molien series for A_6.at n=29A008629
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=31A013583
- a(n) = n*nextprime(n).at n=31A013636
- n*prevprime(n).at n=34A013637
- a(n) = prevprime(n)*nextprime(n).at n=29A013638
- a(n) = prevprime(n)*nextprime(n).at n=33A013638
- a(n) = prevprime(n)*nextprime(n).at n=32A013638
- a(n) = prevprime(n)*nextprime(n).at n=31A013638
- a(n) = prevprime(n)*nextprime(n).at n=30A013638
- Triangle of q-binomial coefficients for q=-6.at n=12A015116
- Gaussian binomial coefficient [ n,2 ] for q = -6.at n=2A015257
- Pseudoprimes to base 26.at n=23A020154
- Pseudoprimes to base 36.at n=13A020164
- Pseudoprimes to base 63.at n=7A020191
- Strong pseudoprimes to base 63.at n=3A020289
- Numbers whose base-6 representation is the juxtaposition of two identical strings.at n=30A020334