15358
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26352
- Proper Divisor Sum (Aliquot Sum)
- 10994
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6576
- Möbius Function
- -1
- Radical
- 15358
- 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
- 115
- 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 n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=19A057002
- Numbers k such that 3*5^k - 2 is prime.at n=24A057917
- a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2.at n=12A060182
- Expansion of q * (chi(-q) * chi(-q^5))^-4 in powers of q where chi() is a Ramanujan theta function.at n=14A093831
- Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.at n=23A115214
- Number of nX3 binary arrays without the pattern 0 0 1 vertically, antidiagonally or horizontally.at n=5A188845
- T(n,k)=Number of nXk binary arrays without the pattern 0 0 1 vertically, antidiagonally or horizontally.at n=33A188851
- Number of 6Xn binary arrays without the pattern 0 0 1 vertically, antidiagonally or horizontally.at n=2A188855
- Convolution of primes with odd primes.at n=20A209403
- a(n) = (n-2)*(n-3)*2^(n-2)+2^n-2.at n=9A217528
- Number of partitions p of n such that (number of numbers of the form 5k + 1 in p) is a part of p.at n=37A241550
- Concatenate n-th composite integer with concatenation of its prime factors in ascending order and the sum of its prime factors.at n=7A245316
- Number of length-n 0..6 arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo 6+1.at n=4A269676
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo k+1.at n=49A269678
- Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo n+1.at n=5A269680
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood.at n=27A269908
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 606", based on the 5-celled von Neumann neighborhood.at n=33A273206
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 431) or the same sequence for the mesh pattern (12, 491).at n=10A289601