13269
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17696
- Proper Divisor Sum (Aliquot Sum)
- 4427
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8844
- Möbius Function
- 1
- Radical
- 13269
- 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
- 94
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76.at n=31A031574
- Arithmetic mean of largest subset of {A063676(1), ......., A063676(n-1)} such that a(n) is an integer and a(n) is maximal.at n=47A063678
- Expansion of -(3 - x + 2*x^2) / (1 - x^3 + x^4).at n=52A110063
- The ED4 array read by antidiagonals.at n=23A167584
- The fifth row of the ED4 array A167584: 80*n^4 + 952*n^2 - 768*n + 525.at n=2A167587
- The third column of the ED4 array A167584.at n=4A167589
- a(1) = 12, a(n) = prime(a(n-1)) - 2a(n-1).at n=9A179512
- a(1) = 1; thereafter a(n) = a(n-1) + d_1^1 + d_2^2 + d_3^3 + ..., where d_1 d_2 d_3 ... is the decimal expansion of a(n-1).at n=20A263535
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=27A345593
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=3A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=3A345852
- Number of integer partitions of n such that (length) * (maximum) <= 2*n.at n=46A361851
- Number of integer partitions of n such that (length) * (maximum) < 2n.at n=46A361852