15830
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28512
- Proper Divisor Sum (Aliquot Sum)
- 12682
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6328
- Möbius Function
- -1
- Radical
- 15830
- 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
- 102
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers whose base-5 representation contains exactly three 0's and three 1's.at n=34A045172
- Integers that do not appear in A103502.at n=6A103504
- Expansion of (5+4x)/(1-2x-x^2).at n=9A105082
- Arithmetic mean of two consecutive prime interprimes of second order: interprimes of third order.at n=5A126556
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, 0)}.at n=10A151391
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {3,4,5} for all i from 1 to n-1.at n=14A174707
- a(0)=-3, a(1)=4; thereafter a(n) = 2*a(n-1) + a(n-2).at n=11A221173
- Number of (n+1) X (3+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=5A251132
- Number of (n+1) X (6+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=2A251135
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=30A251137
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=33A251137
- Least positive integer k such that prime(k*n)^2 - 2 = prime(i*n)*prime(j*n) for some integers 0 < i < j.at n=36A260080
- Number of positive integers k less than 10^n such that k is a sum of two squares and k/2 is an even power.at n=4A275650
- Number of partitions of n with ten parts in which no part occurs more than twice.at n=33A320598
- a(n) is the total binary weight of all persolus bitstrings of length n.at n=21A335206
- Expansion of Sum_{k>0} (1/(1+x^k)^4 - 1).at n=45A363631
- Number of non-subset-sums of strict integer partitions of n.at n=38A365922