10137
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14080
- Proper Divisor Sum (Aliquot Sum)
- 3943
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6480
- Möbius Function
- -1
- Radical
- 10137
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.at n=15A007502
- Fibonacci sequence beginning 1, 16.at n=15A022106
- Convolution of integers >= 3 and Lucas numbers.at n=13A023553
- Numbers whose base-10 representation has exactly 5 runs.at n=24A043641
- Number of times the digit 1 appears in the first 10^n digits of Pi.at n=4A099292
- Expansion of (1-3x+x^2)/((1+x^2)(1-4x+x^2)).at n=8A099487
- Numbers k such that sigma(k)*k is a triangular number.at n=25A115909
- Numbers k such that k + sigma(k) + sigma(sigma(k)) is a square.at n=28A116014
- a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime.at n=31A152531
- Number of zero-sum -n..n arrays of 4 elements with first and second differences also in -n..n.at n=20A201875
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=37A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=37A213184
- Numerator of Z^(2)(n), where Z^(2)(n) = n for n=0,1; thereafter Z^(2)(n) = (1/3)*Sum_{k=1..n-1} Stirling_2(n,k)*Z^(2)(k).at n=6A246307
- L(p) modulo p^2, where p = prime(n) and L is a Lucas number (A000032).at n=41A268478
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 20", based on the 5-celled von Neumann neighborhood.at n=41A269713
- Least integer k such that A001358(k) + A001358(k+1) is the product of exactly n prime factors (counting multiplicity).at n=13A288517
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(1) + b(2) + ... + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A295054
- Expansion of Product_{i>=1, j>=1, k>=1} (1 + x^(i*j*k))^(i*j*k).at n=10A318414
- a(n) is the sum of the Wieferich and Wall-Sun-Sun residues of prime(n).at n=28A339639
- Numbers that can be represented in more than one way as p^2+p*q+q^2 with p and q primes, p<=q.at n=8A349987