10745
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 4039
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- -1
- Radical
- 10745
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Centered cube numbers: n^3 + (n+1)^3.at n=17A005898
- Strong pseudoprimes to base 34.at n=9A020260
- Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=38A028306
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=50A036814
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=35A051872
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 43 for n > 0.at n=11A056255
- Numbers which are sums of two and also sums of three positive cubes.at n=21A085336
- Numbers which are sums of two, three and four cubes.at n=11A085337
- Numbers which are sums of two, three, four and also sums of five cubes.at n=10A085338
- Nonprime numbers n such that phi(n) divides n^2 - 1, where phi(n) (A000010) is Euler's totient function.at n=15A098271
- Self-convolution 4th power of A113670, where a(n) = A113670(n+1)/(n+1).at n=4A113664
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=35A122732
- Prime numbers concatenated with 45.at n=27A137521
- 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, 0), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=8A149519
- a(1)=1; a(2)=2; for n>2, a(n) = a(n-1) + A000217(n-1)*a(n-2).at n=7A166474
- Number of (w,x,y) with all terms in {0,...,n} and max(w,x,y) < 2*min(w,x,y).at n=35A213389
- Number of (n+2) X 7 0..2 matrices with each 3 X 3 subblock idempotent.at n=11A224603
- Row sums of the triangular array A246694.at n=34A246695
- Least integer m > 0 with pi(m*n) = sigma(m), where sigma(m) is the sum of all positive divisors of m.at n=13A247603
- Euler pseudoprimes to base 8: composite integers such that abs(8^((n - 1)/2)) == 1 mod n.at n=41A262055