8187
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 2733
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5456
- Möbius Function
- 1
- Radical
- 8187
- 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
- 127
- 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
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=73A013583
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 89.at n=27A031587
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=28A032701
- Sums of 12 distinct powers of 2.at n=10A038463
- Number of irreducible representations of the symmetric group S_n such that their degree is divisible by 3.at n=31A061569
- 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, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=9A148594
- Partial sums of A162255.at n=20A164053
- a(n) = 2^n - 5.at n=13A168616
- Number of nondecreasing arrangements of n+2 numbers in 0..3 with each number being the sum mod 4 of two others.at n=32A183906
- a(0)=1, a(1)=2; thereafter a(n) = f(n-1) + f(n-2) where f() = A164387().at n=15A185265
- Numbers m such that the Stern polynomial B(m,x) is self-reciprocal.at n=49A186890
- Monotonic ordering of nonnegative differences 2^i-5^j, for 40>=i>=0, j>=0.at n=43A192114
- Greatest number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime).at n=49A217112
- Number of nX3 0..3 arrays with no element equal to one plus the sum of elements to its left or three plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240457
- T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or three plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=18A240460
- Number of 4Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or three plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240463
- Number of partitions p of n such that floor(mean(p)) is a part and ceiling(mean(p)) is not.at n=39A241342
- 2^p - 5 where p is prime.at n=5A241678
- Number of length 5 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=10A254222
- Decimal representation of the n-th iteration of the "Rule 245" elementary cellular automaton starting with a single ON (black) cell.at n=6A267924