13247
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14280
- Proper Divisor Sum (Aliquot Sum)
- 1033
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12216
- Möbius Function
- 1
- Radical
- 13247
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- Integer part of log(n!)^log(n).at n=15A062421
- Nearest integer to log(n!)^log(n).at n=15A062422
- Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.at n=23A087908
- G.f. is the continued fraction: A(x) = 1/[1 - x/[1 - (x-x^2)/[1 - (x^2-x^4)/[1 - (x^3-x^6)/[1-... - (x^n-x^(2n))/[1 - ... ]]]]]]].at n=23A099823
- a(n) = 576*n - 1.at n=22A158372
- Numbers n such that 15*prime(n)+{-4,-2,2,4} are all primes.at n=32A176002
- Number of distinct grids after n moves in the 5T version of Morpion Solitaire.at n=5A204108
- a(n) = numerator(Jtilde3(n)).at n=3A264541
- Sum over all partitions of n of the bitwise OR of the parts.at n=23A306902
- Triangular array, read by rows: T(n,k) = numerator of Jtilde_k(n), 1 <= k <= 2*n+2.at n=14A326303