15265
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 3743
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11760
- Möbius Function
- -1
- Radical
- 15265
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(350).at n=10A041663
- Numbers k such that 157*2^k-1 is prime.at n=15A050830
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=36A066509
- Fourth row of Pascal-(1,5,1) array A081580.at n=8A081590
- a(n) = 11^n+5^n-1^n.at n=4A155638
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/sin(n) > a(k)/sin(a(k)), so that a(1)/sin(a(1)) > a(2)/sin(a(2)) > ... > a(k)/sin(a(k)) > ...at n=35A172445
- a(n) = 12*n^2 - 8*n + 1.at n=36A185212
- Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of n^k into powers of k.at n=49A196879
- Number of partitions of n^5 into powers of 5.at n=4A196883
- Number of partitions of 4^n into powers of n.at n=5A196891
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 2].at n=10A211277
- Number of 2 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=42A240001
- Number of n X 3 nonnegative integer arrays with upper left 0 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=21A252831
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=22A282721
- Numbers n such that there is k < n for which A003557(k) = A003557(n), A048250(k) = A048250(n) and A173557(k) = A173557(n).at n=0A296087
- a(n) = 120*2^n - 95.at n=7A305269
- Two-column table read by rows: Primitive distinct pairs that have the same value of phi, sigma, and tau.at n=25A322688
- Sum of the largest parts of the partitions of n into 10 parts.at n=35A326598
- Least MM-numbers of multisets of multisets with a given number of distinct representatives (obtainable by vertex-permutations).at n=10A330233
- Products p*q*r of three distinct primes such that (p*q) mod r, (p*r) mod q and (q*r) mod p are all prime.at n=18A338704