13599
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19656
- Proper Divisor Sum (Aliquot Sum)
- 6057
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9060
- Möbius Function
- 0
- Radical
- 4533
- 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
- 120
- 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
- a(n) is the number of hierarchical linear models on n unlabeled factors allowing 2-way interactions (but no higher order interactions); or the number of unlabeled simple graphs with <= n nodes.at n=8A006897
- Numbers k such that k and 7*k are anagrams.at n=9A023091
- Arrange digits of cubes in ascending order.at n=39A032553
- Diagonal sums of A103209, viewed as number triangle.at n=9A107704
- Numbers k such that sigma(k) plus the k-th prime is a triangular number.at n=35A115907
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1000-1111-1000 pattern in any orientation.at n=17A146417
- a(n) = 400*n - 1.at n=33A158317
- a(n) = 34*n^2 - 1.at n=19A158588
- Number of (n+3) X 6 binary arrays with every 4 X 4 subblock commuting with each horizontal and vertical neighbor 4 X 4 subblock.at n=13A188099
- Number of n X 4 0..1 arrays with rows, antidiagonals and columns unimodal.at n=4A223633
- Number of nX5 0..1 arrays with rows, antidiagonals and columns unimodal.at n=3A223634
- T(n,k)=Number of nXk 0..1 arrays with rows, antidiagonals and columns unimodal.at n=31A223637
- T(n,k)=Number of nXk 0..1 arrays with rows, antidiagonals and columns unimodal.at n=32A223637
- Triangular array read by rows. T(n,k) is the number of size k connected components over all simple unlabeled graphs with n nodes; n>=1,1<=k<=n.at n=36A224065
- Numbers x whose digits can be permuted to produce a multiple of x.at n=22A245680
- Numbers m for which there exists a k>=2 such that m equals the average of digitsum(m^p) for p from 1 to k.at n=27A259313
- Coefficient of x^0 in the minimal polynomial of the continued fraction [1^n,sqrt(2),1,1,...], where 1^n means n ones.at n=6A266710
- Number of sets of exactly four positive integers <= n having a square element sum.at n=48A281864
- Number of parts in all partitions of n with largest multiplicity three.at n=30A320373
- Number of partitions of n that contain {1,2} minus number of partitions of n that contain neither 1 nor 2.at n=38A324368