13025
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16182
- Proper Divisor Sum (Aliquot Sum)
- 3157
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10400
- Möbius Function
- 0
- Radical
- 2605
- 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
- 107
- 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
- no
- Odd
- yes
Appears in sequences
- Number of atoms in a decahedron with n shells.at n=25A004068
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=25A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=25A004948
- a(n) = A077503(n) - n*10^d, where d = n-A055642(n), A055642(n) = number of digits in n.at n=7A087095
- Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square.at n=16A088319
- Number of distinct lines through the origin in 4-dimensional cube of side length n.at n=10A090026
- Terms in A112039 that are divisible by 3, divided by 3.at n=21A112040
- 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, 1, -1), (0, 1, 1), (1, 0, -1)}.at n=9A148726
- Irregular triangle T(n, k) = A000032(n-2*k+1) if (n-2*k) mod 2 = 0, otherwise 25*A000032(n-2*k), read by rows.at n=49A158786
- Irregular triangle T(n, k) = A000032(n-2*k+1) if (n-2*k) mod 2 = 0, otherwise 25*A000032(n-2*k), read by rows.at n=65A158786
- a(n) = 20*a(n-1)-95*a(n-2) for n > 1; a(0) = 1, a(1) = 10.at n=4A163166
- Number of scalene triangles, distinct up to congruence, on an n X n grid (or geoboard).at n=16A190313
- G.f.: A(x) = Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1-x^k)^(n-k+1).at n=22A206139
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x-y*z<=n.at n=12A212109
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=|x-y|+|y-z|.at n=25A212570
- Square spiral in which each new term is the sum of its two largest neighbors.at n=48A278180
- Absolute multiplicative persistence: a(n) is the least number with multiplicative persistence n for some base b > 1.at n=14A330152
- Number of integer partitions of n whose distinct parts have integer mean.at n=43A360241
- Number of integer partitions of n such that (length) * (maximum) <= 2*n.at n=45A361851
- a(0) = 2, a(n) = (-1)^n + (-2)^n + (1/2) * Sum_{j=1..n} (1-(-1)^j-(-2)^j) * binomial(n,j) * a(n-j) for n > 0.at n=6A370163