15497
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15498
- 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
- 15496
- Möbius Function
- -1
- Radical
- 15497
- 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
- 164
- 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
- 1810
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=23A020400
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 22.at n=4A031610
- Number of primes less than 10000n.at n=16A038813
- Number of partitions satisfying cn(2,5) <= cn(0,5) and cn(3,5) <= cn(0,5).at n=43A039863
- Denominators of continued fraction convergents to sqrt(248).at n=8A041465
- a(n) = round(126*phi^n).at n=22A080074
- a(n) is the n-th prime = -1 (mod n).at n=40A093871
- Primes p whose period of reciprocal equals (p-1)/13.at n=1A098680
- Primes of the form n^2+5*n+c (n>=0), where c=3 for even n and c=-3 for odd n.at n=28A117012
- Running prime totals of prime factors (without multiplicity) of consecutive composite N.at n=38A140610
- Primes congruent to 40 mod 41.at n=40A142237
- Primes congruent to 21 mod 53.at n=38A142551
- Primes congruent to 39 mod 59.at n=30A142766
- Primes congruent to 3 mod 61.at n=30A142801
- Partial sums of A151782.at n=29A151793
- Primes p such that p-1 and p+1 each contain at least one cubed prime in their prime factorization.at n=21A162870
- A triangle with Pell numbers in the first column.at n=57A164981
- Primes p such that sod(p)=2*sod(nextprime(p)).at n=33A175546
- Monotonic ordering of nonnegative differences 5^i-2^j, for 40>=i>=0, j>=0.at n=45A192115
- Number of nX2 0..4 arrays with every row and column running average nondecreasing rightwards and downwards but some diagonal running average having a decrease.at n=5A201340