15161
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15162
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15160
- Möbius Function
- -1
- Radical
- 15161
- 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
- 84
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1771
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(398).at n=6A041757
- Base-7 palindromes that start with 6.at n=31A043020
- Primes whose consecutive digits differ by 4 or 5.at n=21A048416
- Primes p such that p-12, p and p+12 are consecutive primes.at n=10A053072
- Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.at n=37A059762
- Primes of the form prime(2k) followed by prime(k).at n=4A089786
- Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...at n=40A098966
- Primes from merging of 5 successive digits in decimal expansion of the Champernowne Constant.at n=4A104948
- Primes p such that 2p+1, 4p+3, 6p+5 are all primes.at n=17A107020
- Number of permutations of length n which avoid the patterns 1234, 1243, 3241.at n=9A116839
- Smallest prime p such that p divides m^(m+1)+1, where m = (p-2n-1)/(2n).at n=19A123571
- List of triples of primes with common difference 12.at n=31A128312
- Primes p such that q = p+d (with d >= 6) is the next prime and both p and q are Sophie Germain primes.at n=29A128825
- Number of antichains in the first n elements of the infinite Boolean lattice.at n=33A132581
- Inverse Mobius transform of the superabundant numbers, A051731 * A004394.at n=20A134672
- Balanced prime numbers n such that n*(n-1)-1 is a balanced prime.at n=1A138254
- Primes of the form 210k + 41.at n=37A140848
- Primes congruent to 27 mod 47.at n=39A142378
- Primes congruent to 20 mod 49.at n=39A142431
- Primes congruent to 3 mod 53.at n=40A142533