10127
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
- 8
- Divisor Sum
- 11760
- Proper Divisor Sum (Aliquot Sum)
- 1633
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 10127
- 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
- 135
- 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
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=45A010001
- Geometric mean of phi(n) and sigma(n) is an integer, n odd.at n=25A015705
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=34A020445
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=44A024837
- Numbers whose base-10 representation has exactly 5 runs.at n=15A043641
- Number of anagrams of a(n) that are prime increases.at n=9A046888
- a(n) is the least integer that has exactly n anagrams that are primes.at n=12A046890
- a(n) is the least number with exactly n permutations of digits that are primes.at n=17A046893
- Second pentagonal numbers with even index: a(n) = n*(6*n+1).at n=41A049453
- Number of partitions of n in which number of parts is not 2.at n=33A058984
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=33A059400
- Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).at n=32A076449
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=34A108157
- Symmetrical triangular sequence of Fibonacci numbers (A000045): p(x,n) = Product[1 + Fibonacci[i]*x, {i, 0, n}] + x^n*Product[1 + Fibonacci[i]/x, {i, 0, n}].at n=29A154851
- Symmetrical triangular sequence of Fibonacci numbers (A000045): p(x,n) = Product[1 + Fibonacci[i]*x, {i, 0, n}] + x^n*Product[1 + Fibonacci[i]/x, {i, 0, n}].at n=34A154851
- Number of nondecreasing integer sequences of length 20 with sum zero and sum of absolute values 2n.at n=12A158154
- a(n) = (n^3 + 4*n^2 - n)/2.at n=25A162260
- Number of binary strings of length n with equal numbers of 00001 and 00100 substrings.at n=14A164194
- Numbers n such that sigma(n)/phi(n) = 49/36.at n=1A164650
- Number of partitions of n such that the number of parts and the greatest part are not coprime.at n=37A200792