10724
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 10780
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4584
- Möbius Function
- 0
- Radical
- 5362
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 3 and 4 (mod 5).at n=53A035587
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=34A039867
- Number of rooted trees with n nodes with every leaf at height 10.at n=18A048815
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=27A067355
- Smallest multiple of n beginning with the n-th prime.at n=27A078208
- 2*Sum(floor(C(n,w)/w),w=1..n/2-1)+floor(C(n,n/2)/(n/2)) if n is even, otherwise 2*Sum(floor(C(n,w)/w),w=1..(n-1)/2).at n=14A085573
- Sum of first n 5-almost primes.at n=36A086047
- Matrix cube of triangle A105540 and, in this flattened form as read by rows, also equals column 2 of A105540.at n=47A105545
- Admirable Harshad numbers.at n=42A111947
- The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=41A112358
- Numbers that are multiples of 28 and contain both a 4 and a 7.at n=30A171077
- Total number of largest parts in all partitions of n that contain at least two distinct parts.at n=32A182629
- Numbers n such that the decimal expansions of both n and n^2 have 0 as smallest digit and 7 as largest digit.at n=39A256634
- The number of conjugacy classes of invertible n X n matrices over GF(2) which are squares of other such matrices.at n=14A266462
- Numbers n such that Bernoulli number B_{n} has denominator 870.at n=32A272185
- Number of binary necklaces of length n with no subsequence 00000.at n=17A280303
- Least integer k such that k/2^n > phi^2, where phi = (1+sqrt(5))/2 = golden ratio.at n=12A293320
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=34A295865
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A295954
- a(n) = 3*n^2 + 38*n - 76 (n>=2).at n=52A304833