10199
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12288
- Proper Divisor Sum (Aliquot Sum)
- 2089
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8280
- Möbius Function
- -1
- Radical
- 10199
- 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
- 117
- 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
- Numbers whose base-6 representation is the juxtaposition of two identical strings.at n=46A020334
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=36A031597
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=16A036260
- a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1).at n=25A037165
- a(n) = prime(n)^2 - 2.at n=25A049001
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=15A062693
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=27A076425
- Coefficients of polynomials S(n,x) related to Springer numbers.at n=9A098432
- Constant terms of polynomials in A098432.at n=3A098433
- Where records occur in A118878.at n=22A119904
- Difference between squares of legs of primitive Pythagorean triangles, sorted (with multiplicity).at n=27A127923
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=23A136862
- Subset of A037165 (p(n)*p(n+1)-p(n)-p(n+1)) for twin primes.at n=8A137367
- Numbers n which equal the sum of the prime factors of n^2+1217*n+370313.at n=8A159004
- Number of different deltoids (including squares) whose vertices are on an n X n grid.at n=30A159944
- Lower Beatty array of sqrt(3).at n=38A182787
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=22A213318
- Number of idempotent n X n 0..2 matrices of rank n-1.at n=6A224327
- T(n,k)=Number of idempotent n X n 0..k matrices of rank n-1.at n=34A224333
- Number of idempotent 7 X 7 0..n matrices of rank 6.at n=1A224338