15460
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 32508
- Proper Divisor Sum (Aliquot Sum)
- 17048
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6176
- Möbius Function
- 0
- Radical
- 7730
- 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
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=39A051939
- Numbers which are the sum of their proper divisors containing the digit 3.at n=2A059462
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=33A097387
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=4A252153
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=3A252154
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=31A252157
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=32A252157
- Number of nX4 0..1 arrays with no 1 equal to more than one of its king-move neighbors.at n=4A282643
- Number of n X 5 0..1 arrays with no 1 equal to more than one of its king-move neighbors.at n=3A282644
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its king-move neighbors.at n=31A282647
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its king-move neighbors.at n=32A282647
- Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=26A290040
- Number of nXn 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=4A305905
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=4A305908
- T(n,k) = Number of n X k 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=40A305911
- Number of nonempty pairwise coprime subsets of {1,...,n}, where a single number is not considered to be pairwise coprime unless it is equal to 1.at n=27A320426
- Numbers k such that 445*2^k+1 is prime.at n=26A323151
- Number of quadrilateral regions in a "frame" of size n X n (see Comments in A331776 for definition), divided by 8.at n=23A332596
- Number of partitions of prime(n) into squares.at n=40A379551