15789
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22240
- Proper Divisor Sum (Aliquot Sum)
- 6451
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9936
- Möbius Function
- -1
- Radical
- 15789
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 190
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=40A007419
- "DGK" (bracelet, element, unlabeled) transform of 2,2,2,2,...at n=18A032231
- a(n) = floor(a(n-1)*(Pi-1)); a(1) = 1.at n=13A063457
- Numbers n such that 8*10^n-7 is prime.at n=20A099190
- A version of F. K. Hwang's sequence in {3*k, 3*k+1, 3*k+2}.at n=38A123945
- Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=33A125182
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 01110-11111 pattern in any orientation.at n=22A147365
- 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), (-1, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=8A149415
- Number of nX5 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally.at n=7A183347
- Number of nX8 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally.at n=4A183350
- Number of n X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=5A207164
- Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=5A207167
- Number of 6 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=5A207174
- O.g.f.: Sum_{n>=0} n! * n^n * x^n / Product_{k=1..n} (1 - n^2*k*x).at n=4A229259
- Expansion of Product_{k>=1} 1/(1 - k*x^(k^2)).at n=47A285245
- Numbers k such that the decimal expansion of the sum of the reciprocals of the digits of k starts with the digits of k in the same order.at n=5A354466
- Numbers k such that A361338(k) = 9.at n=24A361348