10819
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11200
- Proper Divisor Sum (Aliquot Sum)
- 381
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10440
- Möbius Function
- 1
- Radical
- 10819
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- Coordination sequence for alpha-Mn, Position Mn1.at n=27A009950
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=26A020425
- Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes.at n=26A030018
- Denominators of continued fraction convergents to sqrt(871).at n=10A042683
- Number of nonisomorphic partitions of n on the Ferrers diagram.at n=37A095814
- Indices of primes in sequence defined by A(0) = 41, A(n) = 10*A(n-1) + 81 for n > 0.at n=14A101738
- Numbers n such that 6*10^n + 3*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=18A103033
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=6A151253
- a(n) = A192525(n)/2.at n=22A192526
- Odd integers k such that for every m >= 1 the numbers k*4^m - 1 have at least three prime factors, not necessarily distinct, and k*4^m - 1 has at least two-element covering set.at n=17A233552
- Number of n X 2 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=39A238806
- a(n) = OP(sum{i=0,...,n} OP(binomial(n,i))), where OP(n) is the odd part of n (A000265).at n=14A249401
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=22A289335
- Anagrasum integers: integers N that exactly reproduce their set of digits when we form the set of sums of pairs of adjacent digits.at n=26A296521
- Number of nX4 0..1 arrays with every element equal to 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=12A298959
- a(n) is the smallest denominator D of the fraction N/D with 1 <= D < 2^n which is closest to (3/2)^n.at n=14A324204
- Number of integer partitions of n with no adjacent parts having quotient > 2.at n=39A342094
- Numbers that are the sum of nine fourth powers in eight or more ways.at n=36A345592
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=4A345593
- Numbers that are the sum of nine fourth powers in exactly nine ways.at n=3A345851