10134
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21996
- Proper Divisor Sum (Aliquot Sum)
- 11862
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3372
- Möbius Function
- 0
- Radical
- 3378
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- 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 100.at n=11A031598
- Number of partitions satisfying cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5).at n=35A039838
- Numbers whose base-10 representation has exactly 5 runs.at n=21A043641
- Numbers k such that 165*2^k-1 is prime.at n=47A050834
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=29A054999
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=18A067374
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=29A096926
- Numbers k such that k^2 is a palindrome when written in base 17.at n=34A118651
- a(n) = 9*n^2 - 8*n + 2.at n=34A154254
- Sum of all primes from n-th prime to (2*n-1)-th prime.at n=37A161463
- Number of 3X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 3 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=46A192701
- Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value n+1.at n=13A211837
- Triangle of coefficients of polynomials concerning Newman-like phenomenon of multiples of b+1 in even base b in interval [0,b^n) (see comment).at n=53A212822
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=34A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=34A213184
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=7A213318
- Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k HH's. B(n) is the set of lattice paths of weight n that start in (0,0), end on the horizontal axis and never go below this axis, whose steps are of the following four kinds: a (1,0)-step h of weight 1; a (1,0)-step H of weight 2; a (1,1)-step u of weight 2; a (1,-1)-step d of weight 1. The weight of a path is the sum of the weights of its steps.at n=38A246183
- a(n) = n + (n base 2 regarded as a decimal number).at n=23A269130
- Numbers n such that Bernoulli number B_{n} has denominator 798.at n=41A272138
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A294544