13252
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 23198
- Proper Divisor Sum (Aliquot Sum)
- 9946
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6624
- Möbius Function
- 0
- Radical
- 6626
- Omega Function (Ω)
- 3
- 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
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = A002527(n+1) - A002527(n) - A002526(n).at n=10A002529
- Powers of 2 written in base 6.at n=11A004645
- Percolation series for b.c.c. lattice.at n=6A006811
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=28A031830
- Positive integers not appearing in sequence A098572, which calculates the values of floor(sum(m^(1/m),n=1..m)).at n=45A098573
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, 1), (1, 1, -1), (1, 1, 1)}.at n=7A150857
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks of size 2, i.e., blocks of the form (i,i+1) (0 <= k <= floor(n/2)).at n=45A184174
- Number of rhombuses on a (n+1)X9 grid.at n=36A190097
- Numbers k such that A057775(k) is the factor of a Fermat number 2^(2^m) + 1 for some m.at n=44A201364
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=39A206261
- Total number of parts >= 3 in all partitions of n.at n=27A207033
- Number of partitions of n without three consecutive parts in arithmetic progression.at n=50A238424
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 3.at n=47A240012
- Numbers x such that x^2 = y^3 + z (0 < abs(z) < y).at n=46A268510
- Expansion of Product_{k>=1} (1 + x^(k*(k+1)/2))^(k*(k+1)/2).at n=38A298850
- Numbers k such that 351*2^k+1 is prime.at n=31A323032
- a(1) = 1; for n > 1, a(n) = n*a(n-1) if n is a prime, otherwise a(n) = floor(a(n-1)/A020639(n)), where A020639(n) is the smallest prime divisor of n.at n=31A330252
- Numbers that are the sum of seven fourth powers in five or more ways.at n=26A345571
- Numbers that are the sum of seven fourth powers in exactly five ways.at n=25A345827
- Number of partitions of n in which exactly one even part is repeated and odd parts are unrestricted.at n=37A353902