15383
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15384
- 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
- 15382
- Möbius Function
- -1
- Radical
- 15383
- 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
- 146
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1798
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 2x + 7.at n=14A023275
- Second term of weak prime sextet: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=5A054829
- Third term of weak prime sextet: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=4A054830
- Third term of weak prime septet: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=0A054836
- Primes of the form k^2 + 7.at n=34A079138
- Triangle read by rows in which the n-th row contains the least set of n successive primes whose successive difference forms an arithmetic progression with common difference 2, (successive even numbers).at n=23A094749
- Value of C in y = x^2+7x+C such that y is prime for all x = 0 to 4.at n=24A097436
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 8.at n=29A119595
- First prime divisor of odd composite Mersenne prime reversals.at n=9A134039
- Primes of the form 210k + 53.at n=35A140851
- Primes congruent to 32 mod 43.at n=37A142281
- Primes congruent to 46 mod 49.at n=40A142453
- Primes congruent to 13 mod 53.at n=35A142543
- Primes congruent to 43 mod 59.at n=32A142770
- Primes congruent to 11 mod 61.at n=32A142809
- A144325(n) + A144313(n) + A144315(n).at n=32A144715
- 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, 0), (-1, 1, 0), (1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=7A150957
- Primes p such that 2*p^4+-9 are also prime.at n=11A174365
- a(n) = 81*n^2 - 2247*n + 15383.at n=0A182255
- Floor-Sqrt transform of Sylvester continuants (A002801).at n=10A192680