15766
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 23652
- Proper Divisor Sum (Aliquot Sum)
- 7886
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7882
- Möbius Function
- 1
- Radical
- 15766
- 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
- 84
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 96 ones.at n=4A031864
- Numbers whose base-5 representation contains exactly three 0's and three 1's.at n=23A045172
- Number of optimal binary prefix-free codes with n words all ending in 1.at n=42A055167
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=33A084276
- a(n) = Sum_{i=n..n+3} Sum_{j=i+1..n+4} prime(i)*prime(j).at n=10A127350
- 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, -1, -1), (-1, 0, 1), (0, 0, 1), (1, 0, 0), (1, 1, 0)}.at n=7A151099
- Numbers that are the product of two distinct primes and they are partial sum of products of two distinct primes.at n=30A168476
- Semiprimes that are the sum of 10 consecutive primes.at n=20A185347
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 6,6,0,2,0,0,1 for x=0,1,2,3,4,5,6.at n=5A198057
- The maximum possible number of rooted triples consistent with any galled-tree (level-1 phylogenetic network) containing exactly n leaves.at n=41A216499
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=37A240295
- Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=7A240296
- Expansion of e.g.f. 1 / (-2 + Sum_{k=1..3} exp(-k*x)).at n=4A366298