10109
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11040
- Proper Divisor Sum (Aliquot Sum)
- 931
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9180
- Möbius Function
- 1
- Radical
- 10109
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 179
- 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
- Number of fixed-point-free permutation groups of degree n.at n=13A000637
- Simple triangulations of a disk: column 4 of square array in A210664.at n=8A004305
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=23A020427
- Number of compositions (ordered partitions) of n into distinct parts >= 2.at n=31A032022
- Composite numbers whose prime factors contain no digits other than 1 and 9.at n=12A036309
- Denominators of continued fraction convergents to sqrt(700).at n=12A042347
- Numbers whose base-10 representation has exactly 5 runs.at n=8A043641
- Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.at n=47A065461
- Numbers n such that sigma(sigma(n) - phi(n)) = phi(sigma(n) + phi(n)).at n=7A074876
- Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.at n=16A074889
- Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=8A083512
- Where records occur in A118878.at n=13A119904
- a(n) = smallest positive composite integer such that a(n)-10^k is prime for all k=1,2..n.at n=3A123933
- a(n) = 5*n^2 + 20*n + 4.at n=42A134547
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 8 and 9.at n=56A136835
- a(n) = 361*n + 1.at n=27A158310
- a(n) = 28*n^2 + 1.at n=19A158556
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=39A173337
- Number of scalene triangles, distinct up to congruence, on an n X n grid (or geoboard).at n=15A190313
- Number of (n+1)X(n+1) 0..3 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing.at n=1A203779