10241
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 3439
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- 0
- Radical
- 1463
- 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
- 179
- 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
- Cullen numbers: a(n) = n*2^n + 1.at n=10A002064
- Numbers that are the sum of 11 positive 10th powers.at n=10A004811
- Numbers that are the sum of 6 positive 11th powers.at n=5A004817
- Numbers that are the sum of at most 6 positive 11th powers.at n=26A004912
- Numbers that are the sum of at most 7 positive 11th powers.at n=31A004913
- Numbers that are the sum of at most 8 positive 11th powers.at n=36A004914
- Length of longest trail (i.e., path with all distinct edges) on the edges of an n-cube.at n=11A005985
- Array (a frieze pattern) defined by a(n,k) = (a(n-1,k)*a(n-1,k+1) - 1) / a(n-2,k+1), read by antidiagonals.at n=44A007754
- Least term in period of continued fraction for sqrt(n) is 5.at n=35A031429
- a(n) = T(8,n), array T given by A048471.at n=4A036549
- Positive numbers having the same set of digits in base 8 and base 10.at n=35A037442
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=17A050780
- Number of primitive subsequences of {1, 2, ..., n}.at n=20A051026
- a(0) = 0, a(1) = 1, a(2*n) = n*a(2*n-1) + a(2*n-2), a(2*n+1) = a(2*n) + a(2*n-1).at n=13A056921
- a(n) = n*a(n-1) - a(n-2), with a(-1) = 0, a(0) = 1.at n=9A058797
- Generalized sum of divisors function: third diagonal of A060044.at n=37A060045
- Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=23A071595
- a(n) = 512*n + 1.at n=20A076338
- Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=13A082605
- a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.at n=11A083575