10373
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
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 1723
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8800
- Möbius Function
- -1
- Radical
- 10373
- 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
- 42
- 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
- Number of permutations of [n] with four inversions.at n=18A005287
- Shifts 6 places right under binomial transform.at n=11A010746
- Shifts 6 places left under inverse binomial transform.at n=17A010747
- Quasi-Carmichael numbers to base 5: squarefree composites n such that (n,2*3) = 1 and prime p|n ==> p-5|n-5.at n=5A029558
- For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer.at n=22A029591
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=14A070193
- Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.at n=24A074789
- Numbers k such that p(k)# + p(k+1)# + 1 is prime, where p(k)# is the product of first k primes (A002110).at n=20A128421
- Numbers k such that 9^k - 2 is a prime.at n=13A128455
- Arises in patience sorting and its generalizations.at n=10A129698
- 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), (-1, 0, 0), (1, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150743
- 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), (-1, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 0)}.at n=7A151054
- Number of reduced words of length n in the Weyl group A_21.at n=4A161518
- Number of binary strings of length n with no substrings equal to 0000 1001 or 1011.at n=16A164444
- The initial decimal digits of 2^a(n) are the decimal digits of n followed by n.at n=37A171652
- Constant term in the reduction by (x^2 -> x + 1) of the polynomial p(n,x) given in Comments.at n=9A192876
- 41 times triangular numbers.at n=22A195038
- Engel expansion of beta = 3/(2*log(alpha/2)); alpha = A195596.at n=13A195601
- a(n) = Sum_{i=1..n} ( Product_{k|i} d(k) ), where d(n) = A000005(n).at n=25A237349
- Quasi-Carmichael numbers to exactly two bases.at n=22A257752