13051
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13504
- Proper Divisor Sum (Aliquot Sum)
- 453
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12600
- Möbius Function
- 1
- Radical
- 13051
- 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
- 76
- 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
- Quadrinomial coefficients.at n=9A005725
- Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=13A016067
- Pseudoprimes to base 12.at n=38A020140
- Pseudoprimes to base 20.at n=36A020148
- Pseudoprimes to base 21.at n=28A020149
- Pseudoprimes to base 35.at n=29A020163
- Pseudoprimes to base 77.at n=40A020205
- Strong pseudoprimes to base 12.at n=10A020238
- Strong pseudoprimes to base 20.at n=8A020246
- Strong pseudoprimes to base 21.at n=7A020247
- Strong pseudoprimes to base 35.at n=6A020261
- Strong pseudoprimes to base 44.at n=14A020270
- Strong pseudoprimes to base 77.at n=8A020303
- Strong pseudoprimes to base 82.at n=23A020308
- Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=34A055202
- Smallest integer > 1 which is both n-gonal and centered n-gonal.at n=27A072277
- Consider a 3 X 3 X 3 Rubik cube, but only allow the moves M_R, D; sequence gives number of positions that are exactly n moves from the start.at n=16A080617
- Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=38A102425
- Numbers n such that 4*10^n + R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A102981
- Odd winning positions in Fibonacci nim.at n=25A120904