15779
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16320
- Proper Divisor Sum (Aliquot Sum)
- 541
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15240
- Möbius Function
- 1
- Radical
- 15779
- 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
- 102
- 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
- Numbers whose base-5 representation contains exactly three 0's and three 1's.at n=27A045172
- Numbers k such that 181*2^k-1 is prime.at n=43A050842
- Number of positive integers <= 2^n of form 6 x^2 + 9 y^2.at n=18A054184
- 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, 1, 0), (1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=7A150960
- Number of n X n 0..2 arrays with rows unimodal and columns nondecreasing.at n=3A224184
- Number of n X 4 0..2 arrays with rows unimodal and columns nondecreasing.at n=3A224186
- T(n,k) = Number of n X k 0..2 arrays with rows unimodal and columns nondecreasing.at n=24A224190
- Number of 4Xn 0..2 arrays with rows unimodal and columns nondecreasing.at n=3A224191
- Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=33A254905
- Numbers k such that (7*10^k - 313) / 9 is prime.at n=22A278707
- Start the sequence with a(1) = 3. From now on iterate: if |a(n)| is prime, subtract from a(n) the |a(n)|-th prime of the list of primes A000040 and if |a(n)| is nonprime, add to a(n) the |a(n)|-th nonprime of the list of nonprimes A018252.at n=17A374834
- Start the sequence S with a(1) = 1008973 and extend S with a(n)/2 when a(n) is even, otherwise with a(n) + the smallest prime not yet added.at n=13A388141