10291
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
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 293
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10000
- Möbius Function
- 1
- Radical
- 10291
- 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
- 60
- 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
- no
- Odd
- yes
Appears in sequences
- Lucky numbers with size of gaps equal to 20 (lower terms).at n=21A031902
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 83 ).at n=36A063356
- Smallest solution to phi(x) = 10^n where phi(x) = A000010(x).at n=4A072075
- Number of "sets of odd lists", cf. A000262.at n=7A088009
- Duplicate of A072075.at n=4A097649
- a(n) = 81*n^2 - 118*n + 43.at n=12A156677
- Numbers n such that 10^n - 1 divides 10^(10^100) - 10.at n=32A200879
- Second 14-gonal numbers: n*(6*n+5).at n=41A211014
- Number of partitions of n such that no part is a sum of two other parts.at n=45A236912
- Number of nX3 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=5A240390
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=33A240394
- Number of 6Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240398
- Number of (5+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=24A252724
- Number of integers in n-th generation of tree T(1/4) defined in Comments.at n=51A274144
- Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. Product_{j > 0, j mod k > 0} exp(x^j).at n=43A293525
- Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 2 or 3 1s.at n=4A295411
- Number of nX5 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 2 or 3 1s.at n=2A295413
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 2 or 3 1s.at n=23A295416
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 2 or 3 1s.at n=25A295416
- a(1) = number of 1-digit primes (that is, 4: 2,3,5,7); then a(n) = number of distinct n-digit prime numbers obtained by left- or right-concatenating a digit to the a(n-1) primes obtained in the previous iteration.at n=16A298048