10129
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
- 11584
- Proper Divisor Sum (Aliquot Sum)
- 1455
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8676
- Möbius Function
- 1
- Radical
- 10129
- 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
- 73
- Smith Number
- no
- 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
- Numbers k such that Fib(k) == -13 (mod k).at n=36A023167
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=20A031828
- Numerators of continued fraction convergents to sqrt(857).at n=7A042654
- Numbers whose base-10 representation has exactly 5 runs.at n=17A043641
- Numbers k such that 2^k + 9 is prime.at n=41A057196
- Where records occur in A118878.at n=15A119904
- a(n) = least k such that the remainder of 30^k divided by k is n.at n=36A128370
- 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, -1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=10A148137
- Partial sums of A007694.at n=35A174030
- Least semiprime having prime factors that differ by 2*n!.at n=5A190662
- G.f. satisfies: A(x) = x*Product_{n>=1} (1 + x*A(x)^n).at n=14A192477
- Number of zero-sum -3..3 arrays of n elements with first and second differences also in -3..3.at n=7A201868
- T(n,k)=Number of zero-sum -k..k arrays of n elements with first and second differences also in -k..k.at n=52A201873
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=29A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=29A213184
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=13A213319
- Number of partitions of n+2 with largest inscribed rectangle having area <= n.at n=31A218623
- Number of palindromic partitions of n whose greatest part has multiplicity <= 2.at n=51A238785
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=6A252401
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=34A252407