10606
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
- 4
- Divisor Sum
- 15912
- Proper Divisor Sum (Aliquot Sum)
- 5306
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5302
- Möbius Function
- 1
- Radical
- 10606
- Omega Function (Ω)
- 2
- 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
- 148
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 96 ones.at n=0A031864
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=30A057123
- Sum of the remainders when n^2 is divided by squares less than n.at n=43A067459
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (n+2j)!/(i! * (3j)! * k!).at n=5A092469
- Let M be the matrix defined in A111490. Sequence gives the sum of the elements of the submatrices (from the upper left element): M(1,1); M(1,1)+M(1,2)+M(1,2)+M(2,2); M(1,1)+M(1,2)+M(1,3)+M(2,1)+M(2,2)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc.at n=34A123326
- Lesser of twin simili-primes of order 2.at n=37A126699
- 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, 0), (-1, 0, 1), (-1, 1, -1), (1, -1, 0), (1, 0, 0)}.at n=11A148034
- Number of 4 X 4 X 4 triangular nonnegative integer arrays, symmetric under 120 degree rotation, with all sums of an element and its neighbors <= n.at n=30A166212
- a(n) = prime(n)^2-3.at n=26A182200
- Location of the first gap of exactly n in Ulam numbers, or zero if none is known. The zero terms are conjectural.at n=48A214603
- Floor(AGM(n^2, n^3)), where AGM denotes the arithmetic-geometric mean.at n=32A234362
- Number of (4+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=33A250658
- Partition the primes into groups with semiprime sums: {2,3,5},{7,11,13,17,19,23,29}, {31,37,41,43,47,53,59,61,67,71,73},.... The sequence lists the sums of the groups.at n=41A338975
- a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such integer exists.at n=35A350207
- Smith numbers (A006753) for which the arithmetic derivative (A003415) is also a Smith number.at n=45A357841
- Number of length n strings on the alphabet {0,1,2,3} with digit sum at most 4.at n=20A363256
- Consecutive states of the linear congruential pseudo-random number generator 170*s mod 30323 when started at s=1.at n=15A385033
- Number of edges in the directed graph for the Reversed Zeckendorf game with starting number n.at n=42A389617