10018
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15030
- Proper Divisor Sum (Aliquot Sum)
- 5012
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5008
- Möbius Function
- 1
- Radical
- 10018
- 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
- 91
- Smith Number
- no
- 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 continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 100.at n=2A031598
- Convolution of A073709, which is also the first differences of the unique terms of A073709.at n=14A073710
- Sum(j=1,n,floor(A000041(j)/j)).at n=42A086736
- Table of number of domino tilings of generalized Aztec pillows of type (1, ..., 1, 3, 1, ..., 1)_n.at n=39A112830
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=66A122795
- 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, 0, 1), (0, 1, 0), (1, -1, 1), (1, 0, -1), (1, 0, 1)}.at n=7A150625
- 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), (0, 0, 1), (0, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=7A150711
- Numbers k such that the sum of the decimal digits of k is a substring of k, of k^2 and of k^3.at n=31A162017
- Partial sums of primes of the form 3*k-1.at n=46A172188
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7 and 16*k-15 are also products of two distinct primes.at n=41A177213
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=15A177214
- 1/16 the number of (n+1) X 8 0..3 arrays with all 2 X 2 subblocks having the same four values.at n=10A184037
- Number of partitions of 12*n into parts < 5.at n=9A191593
- a(n) = Sum_{i+j=n, i,j >= 1} tau(i)*sigma(j), where tau() = A000005(), sigma() = A000203().at n=55A191831
- Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=16A207142
- Lengths of binary representations of prime Fibonacci numbers.at n=26A215367
- Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=30A229446
- Number of partitions of 4n into 4 parts.at n=27A238340
- a(n) = A239460(n) / n^2.at n=17A239463
- Number of partitions of 7n into exactly 4 parts.at n=16A256329