15650
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29202
- Proper Divisor Sum (Aliquot Sum)
- 13552
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 3130
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 146
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Least term in period of continued fraction for sqrt(n) is 10.at n=26A031434
- a(n) = n^3 + n.at n=25A034262
- Sums of two distinct powers of 5.at n=17A038474
- Sums of two powers of 5.at n=23A055237
- Numbers k such that k-1, k-3, k-7 and k-9 are all prime.at n=13A064974
- a(n) = n^3+n for odd n, (n^3+n)*3/2 for even n: Row sums of A093915.at n=24A093917
- a(n) = 625*n^2 + 25.at n=4A157915
- a(n) = 25*n^2 + n.at n=24A173089
- Size of the set of b for numbers of the form 2^n*x + b that cannot be the smallest element of a set giving a duration of infinite flight in the Collatz problem.at n=13A182137
- Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=9A186464
- Numbers that can be represented as a sum of two distinct nontrivial prime powers in three or more ways.at n=15A225104
- For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of successive numbers m which d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1) is an integer.at n=12A229996
- Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.at n=39A239100
- Number of partitions p of n such that mean(p) >= multiplicity(min(p)).at n=39A240079
- Row sums of A273751.at n=29A274248
- Number of (undirected) Hamiltonian paths on the n-prism graph.at n=22A308137
- Number of integer partitions of n containing no part > 1 whose prime indices all belong to the partition.at n=50A324754
- Consider all the Pythagorean triangles with perimeter A010814(n). Then a(n) is the sum of the areas of the squares on all of their sides.at n=20A334808
- Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity.at n=36A351293
- Triangle read by rows: T(n,k) is the number of distinct tuples E each corresponding to some k-ary word W = (w_1, ..., w_n), where E is a tuple (e_1, ..., e_{n-1}) with e_i being the number of pairs of equal letters (w_j,w_k) in W such that j + i = k.at n=50A381349