10593
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16848
- Proper Divisor Sum (Aliquot Sum)
- 6255
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6360
- Möbius Function
- 0
- Radical
- 3531
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 130
- 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
- Related to population of numbers of form x^2 + y^2.at n=15A000693
- Generalized Catalan Numbers x^3*A(x)^2 -(1-x+x^3+x^4)*A(x) + 1 =0.at n=19A023433
- Number of days in n years (n=1 is the first leap year).at n=28A033174
- a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 2's.at n=5A048533
- 22-gonal numbers: a(n) = n*(10*n-9).at n=33A051874
- phi(s(n^3)) is a square, where s(n) is sigma(n)-n (A001065).at n=19A063798
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=28A079161
- Triangle read by rows: odd-numbered rows of A106580.at n=67A106595
- Expansion of 1/(1-x^2*c(3x)), c(x) the g.f. A000108.at n=7A110525
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1101-0111 pattern in any orientation.at n=14A146726
- Demi-tribonacci numbers (rounding down): a(0)=a(1)=0, a(2)=2; a(n) = floor( (a(n-1)+a(n-2)+a(n-3))/2 ).at n=48A180234
- a(n) = (1/n) * A205454(n).at n=29A205455
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and 0 <= determinant <= n.at n=8A211146
- Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 nX5 array.at n=2A221443
- T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 nXk array.at n=23A221446
- Hilltop maps: number of 3Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 3Xn array.at n=4A221448
- Number of compositions of n into parts {3,4,5} when all parts 3,4 and 5 are present.at n=26A243254
- E.g.f. satisfies: A(x - Integral 2*A(x) dx) = x + Integral A(x) dx.at n=4A279844
- 1/4 of the even edge of least 2-adic valuation of a primitive 3-simplex (0, b=A031173, c=A031174, d=A031175).at n=52A298046
- a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).at n=39A306829