10525
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13082
- Proper Divisor Sum (Aliquot Sum)
- 2557
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- 0
- Radical
- 2105
- 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
- 192
- 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 n-step spirals on hexagonal lattice.at n=15A006778
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=19A020342
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=36A020370
- a(n) = position of n^3 + 9 in A003072.at n=45A024971
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 18.at n=5A031606
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=31A031899
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+7 or 24k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=48A036032
- Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once.at n=52A090858
- Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts.at n=35A092310
- Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11.at n=39A146335
- a(n) is the number of zeros needed to write the integers 1 through Fibonacci(n).at n=22A155881
- a(n) = 18*a(n-1) - 79*a(n-2) for n > 1; a(0) = 1, a(1) = 10.at n=4A163461
- Number of arrangements of 3 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=21A190072
- Trajectory of 80 under the map n-> A006368(n).at n=24A223087
- a(n) is the minimal odd odious k > 1, such that k^i, i=1,2,...,n, all are odious, or a(n)=0, if there is no such k.at n=10A230496
- a(n) is the minimal odd odious k > 1, such that k^i, i=1,2,...,n, all are odious, or a(n)=0, if there is no such k.at n=11A230496
- a(n) is the minimal odd odious k > 1, such that k^i, i=1,2,...,n, all are odious, or a(n)=0, if there is no such k.at n=12A230496
- Numbers k such that k^2 - k - 1, k^3 - k - 1, and k^4 - k - 1 are all prime.at n=34A236171
- Number of nX3 0..1 arrays with no element equal to exactly one horizontal or vertical neighbor, with new values 0..1 introduced in row major order.at n=9A240651
- Numbers n such that the digit sum of Fibonacci(n) is equal to the digit sum of Lucas(n).at n=31A244923