9151
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 9152
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 9150
- Möbius Function
- -1
- Radical
- 9151
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 91
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1134
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Convolution of Fibonacci numbers and (1, prime(1), prime(2), ...).at n=15A023608
- Integer part of ((4th elementary symmetric function of 2,3,...,n+4)/(2nd elementary symmetric function of 2,3,...,n+4)).at n=22A024181
- 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 95.at n=10A031593
- Numbers whose base-4 representation contains exactly two 2's and four 3's.at n=31A045147
- Primes with first digit 9.at n=31A045715
- Primes p such that x^61 = 2 has no solution mod p.at n=22A059230
- Number of partitions of n in which the number of parts divides n.at n=39A067538
- Take A000040, omit commas: 23571113171923..., select 4-digit primes seen when scanning from left.at n=12A073037
- a(n) = largest prime <= n*prime(n).at n=45A079780
- a(n) = 10*n^2 + 5*n + 1.at n=30A080860
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.at n=31A087863
- Primes that are a sum of twin primes and their indices.at n=29A088187
- Let a(1) = 1, a(2) = 2, a(3) = 7, a(4) = 15 and for n >= 5 set a(n) = (n*b(n) - b(n-2)) / 2, where b(n) = 4*b(n-2) - b(n-4) for n >= 5 and b(1) = 1, b(2) = 2, b(3) = 5, b(4) = 8.at n=11A093652
- Value of C in y = x^2 + 9x + C such that y is prime for all x = 0 to 5.at n=10A097437
- Greatest prime that differs from prime(n) in decimal representation by exactly one editing operation: deletion, insertion, or substitution.at n=35A097722
- Prime numbers q such that q^2 = 2*prime(n) + n for some n.at n=43A104852
- Maximal troughs in decimal expansions of Pi: positions of troughs equal to 8.at n=13A105276
- Prime numbers p such that p+6 and p^2+6^2 are both primes.at n=39A107442
- Numerators in expansion of 1/((1-4x^2)^(1/4)*sqrt(1+x)).at n=6A110115
- Primes of the form 64n+63.at n=30A127579