10519
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10744
- Proper Divisor Sum (Aliquot Sum)
- 225
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10296
- Möbius Function
- 1
- Radical
- 10519
- 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
- 104
- 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
- Expansion of tan(tan(x)/cos(x)).at n=3A009708
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=20A020429
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=34A031822
- a(n) = left term in M^n * [1 0 0], where M = the 3 X 3 matrix [1 -1 0 / -1 4 -3 / 0 -3 3].at n=7A094431
- a(n) = A095258(A095258(n)).at n=29A095260
- Number of distinct means of nonempty subsets of {1,...,n}.at n=46A135342
- Number of 0..2 arrays x(0..n-1) of n elements with zero n-1st difference.at n=16A200148
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=32A214453
- a(n) = prime(n) * prime(2*n-1).at n=18A219603
- Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=20A231558
- Start with a single hexagon; at n-th generation add a hexagon at each expandable vertex (this is the "vertex to side" version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=16A247905
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=9A263510
- Numbers k such that (19*10^k + 119)/3 is prime.at n=18A281929
- Number of integer partitions of n whose LCM is a multiple of n.at n=45A327778
- Number of integer partitions of n with biquanimous multiplicities.at n=39A371839
- a(0) = 0, and for n > 0, a(n) = a(n-1) + A019565(a(n-1)), where A019565 is the base-2 exp-function.at n=6A376407