8149
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8460
- Proper Divisor Sum (Aliquot Sum)
- 311
- 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
- 7840
- Möbius Function
- 1
- Radical
- 8149
- 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
- 52
- Smith Number
- yes
- 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
- Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=17A000864
- Number of ways in which n identical balls can be distributed among 4 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=28A005337
- Pseudoprimes to base 10.at n=28A005939
- a(n) = (n^3 + 2*n)/3.at n=29A006527
- Number of fullerenes with 2n vertices (or carbon atoms).at n=25A007894
- Continued fraction for zeta(13).at n=1A013689
- Second term in continued fraction for zeta(n).at n=11A013697
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=21A015988
- Pseudoprimes to base 28.at n=29A020156
- Pseudoprimes to base 39.at n=21A020167
- Pseudoprimes to base 59.at n=34A020187
- Pseudoprimes to base 79.at n=34A020207
- Pseudoprimes to base 100.at n=43A020228
- Strong pseudoprimes to base 10.at n=5A020236
- Strong pseudoprimes to base 39.at n=9A020265
- Strong pseudoprimes to base 59.at n=13A020285
- Strong pseudoprimes to base 100.at n=19A020326
- Least number of Sort-then-add persistence n.at n=32A033863
- Least number of Sort-then-add persistence n.at n=32A033908
- Smallest Fibonacci number that has n as a factor, divided by n.at n=38A037943