15331
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15332
- 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
- 15330
- Möbius Function
- -1
- Radical
- 15331
- 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
- 58
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1792
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-2) + (2n-1)a(n-1); a(0)=1, a(1)=1.at n=6A025164
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 94 ones.at n=7A031862
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) and cn(2,5) + cn(3,5) <= cn(0,5) + cn(4,5).at n=41A039865
- Discriminants of imaginary quadratic fields with class number 19 (negated).at n=28A046016
- Primes of form 210*p + 1 where p is a prime.at n=13A051648
- Primes such that the sum of the squares of its digits is equal to the product of its digits.at n=3A067779
- Primes of the form 210n + 1.at n=34A073102
- Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.at n=36A094932
- Numbers k such that k + (largest digit of k)! is a palindromic prime.at n=8A095920
- Decimal Goedelization of antitheorems from propositional calculus, in Richard C. Schroeppel's metatheory of A101273.at n=14A100200
- Primes arising in A111674.at n=3A111675
- Primes p = prime(i) of level (1,3), i.e., such that A118534(i) = prime(i-3).at n=24A118467
- Irregular array where row n is the positive integers which divide the sum of all previous rows. a(1,1)=1.at n=46A119763
- a(n) is n-th prime == 1 (mod 6n).at n=34A138906
- Binomial transform of [1, 30, 30, 30, ...].at n=9A139700
- Primes congruent to 9 mod 47.at n=33A142360
- Primes congruent to 14 mod 53.at n=31A142544
- Primes congruent to 50 mod 59.at n=30A142777
- Primes congruent to 20 mod 61.at n=27A142818
- Largest primes of 'a' consecutive primes whose sum is a prime in A152471.at n=34A152472