15186
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 30384
- Proper Divisor Sum (Aliquot Sum)
- 15198
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5060
- Möbius Function
- -1
- Radical
- 15186
- 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
- 177
- 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
- Coordination sequence for sigma-CrFe, Position Xb.at n=31A009960
- Smallest integer k such that 2^n is the largest power of two that is contained in 2^k as a proper substring.at n=22A046300
- Number of primes between successive Fibonacci numbers exclusive.at n=27A052011
- Numbers which are the sum of their proper divisors containing the digit 5.at n=22A059464
- Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045).at n=26A095354
- Numbers whose square is a permutational number A134640.at n=44A134742
- Number of length n arrays x(i), i=1..n with x(i) in i..i+6 and no value appearing more than 2 times.at n=4A250349
- T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 2 times.at n=49A250351
- Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 2 times.at n=5A250354
- Strings of 5 digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0.at n=26A288355
- Row 4 in rectangular array A292929.at n=24A294067
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A299571
- Number of nX7 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A299573
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=59A299574
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=61A299574
- Partial sums of A033617.at n=31A299903
- Number of pairs of 2 X 2 matrices (X,Y) over Z/nZ such that X*Y = 0 and Y*X <> 0.at n=5A338099
- a(n) is the exponent of the least power of 2 such that the concatenated digits of the decimal expansion of 2^n are a proper substring of the concatenated digits of the decimal expansion of 2^a(n).at n=22A342575
- Number of integer compositions of n whose 0-prepended first differences are not all distinct.at n=15A389744